Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Edition: Version 22. August 2013

Language: Englisch

Bibliographic citation: Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 49

Classification: Informatik

Event: Veröffentlichung

(where): Frankfurt am Main

(who): Univ.-Bibliothek Frankfurt am Main

(when): 2013

Creator: Schmidt-Schauß, Manfred
Sabel, David
Machkasova, Elena

URN: urn:nbn:de:hebis:30:3-342348

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 25.03.2025, 1:45 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Schmidt-Schauß, Manfred
Sabel, David
Machkasova, Elena
Univ.-Bibliothek Frankfurt am Main

Time of origin

2013

Other Objects (12)

Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq

A non-deterministic call-by-need lambda calculus

Simulation in the call-by-need lambda-calculus with letrec

On equivalences and standardization in a non-deterministic call-by-need lambda calculus

Hochschulschrift

Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence

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, case, constructors, and seq

A non-deterministic call-by-need lambda calculus

Simulation in the call-by-need lambda-calculus with letrec

On equivalences and standardization in a non-deterministic call-by-need lambda calculus

Hochschulschrift

Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence

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, case, constructors, and seq

A non-deterministic call-by-need lambda calculus

Simulation in the call-by-need lambda-calculus with letrec

On equivalences and standardization in a non-deterministic call-by-need lambda calculus

Hochschulschrift

Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence

A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

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

A non-deterministic call-by-need lambda calculus

Simulation in the call-by-need lambda-calculus with letrec

Simulation in the call-by-need lambda-calculus with letrec

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

A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

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, case, constructors, and seq

Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq

A non-deterministic call-by-need lambda calculus

Simulation in the call-by-need lambda-calculus with letrec

Simulation in the call-by-need lambda-calculus with letrec

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

A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

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, case, constructors, and seq

Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq

A non-deterministic call-by-need lambda calculus

Simulation in the call-by-need lambda-calculus with letrec

Simulation in the call-by-need lambda-calculus with letrec

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

A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

Related objects

Reset password