- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Proceedings of the third ACM SIGPLAN international conference on Functional programming, Baltimore, Maryland, United States, S. 324 - 335
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
1998
- Urheber
- URN
-
urn:nbn:de:hebis:30-19313
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 MESZ
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
- Kutzner, Arne
- Schmidt-Schauß, Manfred
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 1998
Ä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
On equivalences and standardization in 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
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
A finite simulation method in a non-deterministic call-by-need calculus with letrec, constructors and case
A finite simulation method in a non-deterministic call-by-need calculus with letrec, constructors and case
Improving lazy non-deterministic computations by demand analysis
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
Automatic equivalence proofs for non-deterministic coalgebras
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
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
A finite simulation method in a non-deterministic call-by-need calculus with letrec, constructors and case
A finite simulation method in a non-deterministic call-by-need calculus with letrec, constructors and case
Improving lazy non-deterministic computations by demand analysis
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec
Automatic equivalence proofs for non-deterministic coalgebras
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
A non-deterministic call-by-need lambda calculus : proving similarity a precongruence by an extension of Howe's method to sharing
Counterexamples to simulation in non-deterministic call-by-need lambda-calculi with letrec
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi
A finite simulation method in a non-deterministic call-by-need calculus with letrec, constructors and case
A finite simulation method in a non-deterministic call-by-need calculus with letrec, constructors and case
Improving lazy non-deterministic computations by demand analysis
Simulation in the call-by-need lambda-calculus with letrec
Simulation in the call-by-need lambda-calculus with letrec