License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2012.152
URN: urn:nbn:de:0030-drops-36703
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3670/

Carraro, Alberto ; Salibra, Antonino

On the equational consistency of order-theoretic models of the lambda-calculus

pdf-format:
Dokument 1.pdf (440 KB)


Abstract

Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not satisfied in any partially ordered model with bottom element. We also relate the subtractive equations to the open problem of the order-incompleteness of lambda calculus.

BibTeX - Entry

@InProceedings{carraro_et_al:LIPIcs:2012:3670,
  author =	{Alberto Carraro and Antonino Salibra},
  title =	{{On the equational consistency of order-theoretic models of the lambda-calculus}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{152--166},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{Patrick C{\'e}gielski and Arnaud Durand},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3670},
  URN =		{urn:nbn:de:0030-drops-36703},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.CSL.2012.152},
  annote =	{Keywords: Lambda calculus, order-incompleteness, partially ordered models}
}

Keywords: Lambda calculus, order-incompleteness, partially ordered models
Seminar: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL
Issue date: 2012
Date of publication: 27.08.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI