- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Ausgabe
-
Version 6. Januar 2007
- Sprache
-
Englisch
- Erschienen in
-
Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 27
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Univ.-Bibliothek Frankfurt am Main
- (wann)
-
2007
- Urheber
- URN
-
urn:nbn:de:hebis:30-38419
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:50 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
- Schmidt-Schauß, Manfred
- Sabel, David
- Univ.-Bibliothek Frankfurt am Main
Entstanden
- 2007
Ähnliche Objekte (12)
On generic context lemmas for lambda calculi with sharing
On generic context lemmas for lambda calculi with sharing
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Applicative may- and should-simulation in the call-by-value lambda calculus with amb
An abstract machine for concurrent Haskell with futures
Automating the diagram method to prove correctness of program transformations
Alpha-renaming of higher-order meta-expressions
Rewriting of higher-order-meta-expressions with recursive bindings
Sharing decorations for improvements in a functional core language with call-by-need operational semantics
Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings
Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings
Sharing decorations for improvements in a functional core language with call-by-need operational semantics : [Revision V3 from February 29, 2016]
On generic context lemmas for lambda calculi with sharing
On generic context lemmas for lambda calculi with sharing
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Applicative may- and should-simulation in the call-by-value lambda calculus with amb
An abstract machine for concurrent Haskell with futures
Automating the diagram method to prove correctness of program transformations
Alpha-renaming of higher-order meta-expressions
Rewriting of higher-order-meta-expressions with recursive bindings
Sharing decorations for improvements in a functional core language with call-by-need operational semantics
Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings
Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings
Sharing decorations for improvements in a functional core language with call-by-need operational semantics : [Revision V3 from February 29, 2016]
On generic context lemmas for lambda calculi with sharing
On generic context lemmas for lambda calculi with sharing
Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence
Applicative may- and should-simulation in the call-by-value lambda calculus with amb
An abstract machine for concurrent Haskell with futures
Automating the diagram method to prove correctness of program transformations
Alpha-renaming of higher-order meta-expressions
Rewriting of higher-order-meta-expressions with recursive bindings
Sharing decorations for improvements in a functional core language with call-by-need operational semantics
Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings
Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings