Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec

  • This note shows that in non-deterministic extended lambda calculi with letrec, the tool of applicative (bi)simulation is in general not usable for contextual equivalence, by giving a counterexample adapted from data flow analysis. It also shown that there is a flaw in a lemma and a theorem concerning finite simulation in a conference paper by the first two authors.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Manfred Schmidt-SchaußORCiDGND, Elena Machkasova, David SabelORCiDGND
URN:urn:nbn:de:hebis:30-77868
URL:http://www.ki.informatik.uni-frankfurt.de/papers/schauss/simcounter-IB38.pdf
Parent Title (English):Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 38
Series (Serial Number):Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik (38)
Publisher:Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik, Research group for Artificial Intelligence and Software Technology
Place of publication:Frankfurt [am Main]
Document Type:Working Paper
Language:English
Year of Completion:2009
Year of first Publication:2009
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2010/06/22
Tag:Kontextuelle Gleichheit
contextual equivalence; non-determinism; semantics
GND Keyword:Formale Semantik; Lambda-Kalkül; Nichtdeterminismus
Page Number:10
First Page:1
Last Page:10
HeBIS-PPN:224526219
Institutes:Informatik und Mathematik / Informatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Sammlungen:Universitätspublikationen
Licence (German):License LogoDeutsches Urheberrecht