- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA'10) ; Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 2010, ISBN 978-3-939897-18-7, S. 295-231, doi:10.4230/LIPIcs.RTA.2010.295
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2010
- Urheber
-
Schmidt-Schauß, Manfred
Sabel, David
Machkasova, Elena
- URN
-
urn:nbn:de:hebis:30-68385
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Schmidt-Schauß, Manfred
- Sabel, David
- Machkasova, Elena
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2010
Ähnliche Objekte (12)
Simulation in the call-by-need lambda-calculus with letrec
A non-deterministic call-by-need lambda calculus
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Applicative may- and should-simulation in the call-by-value lambda calculus with amb
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
Simulation in the call-by-need lambda-calculus with letrec
A non-deterministic call-by-need lambda calculus
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Applicative may- and should-simulation in the call-by-value lambda calculus with amb
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
Simulation in the call-by-need lambda-calculus with letrec
A non-deterministic call-by-need lambda calculus
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
On equivalences and standardization in a non-deterministic call-by-need lambda calculus
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Applicative may- and should-simulation in the call-by-value lambda calculus with amb