Program equivalences for concurrency abstractions in a concurrent lambda calculus with buffers, cells and futures
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Frankfurt am Main, Johann Wolfgang Goethe-Universität, Bachelorarbeit, 2009
- Keyword
-
Nebenläufigkeit
Lambda-Kalkül
Haskell 98
- Event
-
Veröffentlichung
- (where)
-
Frankfurt am Main
- (who)
-
Universitätsbibliothek Johann Christian Senckenberg
- (when)
-
2009
- Creator
-
Willig, Martina
- Contributor
-
Schmidt-Schauß, Manfred
Sabel, David
- URN
-
urn:nbn:de:hebis:30-67958
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:48 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Willig, Martina
- Schmidt-Schauß, Manfred
- Sabel, David
- Universitätsbibliothek Johann Christian Senckenberg
Time of origin
- 2009
Other Objects (12)
Program equivalence for a concurrent lambda calculus with futures
Constrained lambda calculus
Dynamic Lambda Calculus
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Abstract computing machines : a Lambda calculus perspective
Standard models of the overtyped lambda-calculus
Label dependent lambda calculus and gradual typing
A Coloured Version of the Lambda-Calculus
Program equivalence for a concurrent lambda calculus with futures
Constrained lambda calculus
Dynamic Lambda Calculus
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Abstract computing machines : a Lambda calculus perspective
Standard models of the overtyped lambda-calculus
Label dependent lambda calculus and gradual typing
A Coloured Version of the Lambda-Calculus
Program equivalence for a concurrent lambda calculus with futures
Constrained lambda calculus
Dynamic Lambda Calculus
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
The overtyped lambda calculus
Binary lambda calculus and combinatory logic
Category theory and the simply typed λ-calculus [lambda-calculus]
Abstract computing machines : a Lambda calculus perspective
Standard models of the overtyped lambda-calculus
Label dependent lambda calculus and gradual typing