On equivalences and standardization in a non-deterministic call-by-need lambda calculus
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Ausgabe
-
Version 18. Sept. 2008
- Sprache
-
Englisch
- Erschienen in
-
Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 31
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Univ.-Bibliothek Frankfurt am Main
- (wann)
-
2009
- Urheber
- URN
-
urn:nbn:de:hebis:30:3-344517
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:47 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
- Mann, Matthias
- Univ.-Bibliothek Frankfurt am Main
Entstanden
- 2009
Ähnliche Objekte (12)
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
A non-deterministic call-by-need lambda calculus
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Dynamic Lambda Calculus
Constrained lambda calculus
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
The overtyped 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
A non-deterministic call-by-need lambda calculus
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Dynamic Lambda Calculus
Constrained lambda calculus
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
The overtyped 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
A non-deterministic call-by-need lambda calculus
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
Computing overlappings by unification in the deterministic lambda calculus LR with letrec, case, constructors, seq and variable chains
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
Dynamic Lambda Calculus
Constrained lambda calculus
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi