Show simple item record

Proofs About Lists Using Ellipsis

dc.contributor.authorBundy, Alanen
dc.contributor.authorRichardson, Julianen
dc.date.accessioned2010-04-23T10:41:50Z
dc.date.available2010-04-23T10:41:50Z
dc.date.issued1999-09
dc.identifier.urihttp://hdl.handle.net/1842/3395
dc.descriptionLPAR'99: 6th International Conference on Logic for Programming and Automated Reasoning. Tbilisi, Republic of Georgia, September 6-10, 1999. Lecture Notes in Artificial Intelligence, vol. 1705. Edited by Harald Ganzinger, David McAllester, and Andrei Voronkov. Springer Verlag, September 1999.en
dc.description.abstractIn this paper we explore the use of ellipsis in proofs about lists. We present a higher-order formulation of elliptic formulae, and describe its implementation in the LambdaClam proof planner. We use an unambiguous higher-order formulation of lists which is amenable to formal proofs without using induction, and to display using the familiar ... notation.en
dc.language.isoen
dc.relation.ispartofseriesInformatics Report Seriesen
dc.relation.ispartofseriesEDI-INF-RR-0003en
dc.subjectInformaticsen
dc.titleProofs About Lists Using Ellipsisen
dc.typeTechnical Reporten


Files in this item

Name:
0003.pdf
Size:
195.5Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

  • Informatics Report Series

    • Show simple item record