Lecture Notes in Computer Science - Typed Lambda Calculi and Applications
Latest Publications

TOTAL DOCUMENTS

29

(FIVE YEARS 0)

H-INDEX

11

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540590484, 9783540491781

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Comparing λ-calculus translations in sharing graphs

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014041 ◽

1995 ◽

pp. 1-15 ◽

Author(s):

Andrea Asperti ◽

Cosimo Laneve

Download Full-text

A simple model for quotient types

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014055 ◽

1995 ◽

pp. 216-234 ◽

Author(s):

Martin Hofmann

Keyword(s):

Download Full-text

An explicit Eta rewrite rule

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014047 ◽

1995 ◽

pp. 94-108 ◽

Author(s):

Daniel Briaud

Download Full-text

Third-order matching in the presence of type constructors

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014069 ◽

1995 ◽

pp. 428-442 ◽

Author(s):

Jan Springintveld

Keyword(s):

Download Full-text

Categorical completeness results for the simply-typed lambda-calculus

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014068 ◽

1995 ◽

pp. 414-427 ◽

Author(s):

Alex K. Simpson

Keyword(s):

Lambda Calculus ◽

Typed Lambda Calculus

Download Full-text

Untyped λ-calculus with relative typing

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014056 ◽

1995 ◽

pp. 235-248 ◽

Author(s):

M. Randall Holmes

Download Full-text

Typed λ-calculi with explicit substitutions may not terminate

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014062 ◽

1995 ◽

pp. 328-334 ◽

Author(s):

Paul-André Mellies

Keyword(s):

Explicit Substitutions

Download Full-text

A realization of the negative interpretation of the Axiom of Choice

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014044 ◽

1995 ◽

pp. 47-62

Author(s):

Stefano Berardi ◽

Marc Bezem ◽

Thierry Coquand

Keyword(s):

Axiom Of Choice ◽

The Axiom Of Choice

Download Full-text

A model for formal parametric polymorphism: A per interpretation for system R

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014043 ◽

1995 ◽

pp. 32-46 ◽

Author(s):

Roberto Bellucci ◽

Martin Abadi ◽

Pierre-Louis Curien

Keyword(s):

Parametric Polymorphism

Download Full-text

A simple calculus of exception handling

Lecture Notes in Computer Science - Typed Lambda Calculi and Applications ◽

10.1007/bfb0014054 ◽

1995 ◽

pp. 201-215 ◽

Author(s):

Philippe de Groote

Keyword(s):

Exception Handling

Download Full-text