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

TOTAL DOCUMENTS

30

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540255932, 9783540320142

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract

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

10.1007/11417170_2 ◽

2005 ◽

pp. 10-10

Author(s):

Amy P. Felty

Keyword(s):

Semantic Approach

Download Full-text

Filters on CoInductive Streams, an Application to Eratosthenes’ Sieve

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

10.1007/11417170_9 ◽

2005 ◽

pp. 102-115 ◽

Author(s):

Yves Bertot

Download Full-text

Proof Contexts with Late Binding

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

10.1007/11417170_24 ◽

2005 ◽

pp. 324-338

Author(s):

Virgile Prevosto ◽

Sylvain Boulmé

Download Full-text

On the Degeneracy of Σ-Types in Presence of Computational Classical Logic

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

10.1007/11417170_16 ◽

2005 ◽

pp. 209-220 ◽

Author(s):

Hugo Herbelin

Keyword(s):

Classical Logic

Download Full-text

Naming Proofs in Classical Propositional Logic

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

10.1007/11417170_19 ◽

2005 ◽

pp. 246-261 ◽

Author(s):

François Lamarche ◽

Lutz Straßburger

Keyword(s):

Propositional Logic ◽

Classical Propositional Logic

Download Full-text

The Elimination of Nesting in SPCF

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

10.1007/11417170_18 ◽

2005 ◽

pp. 234-245

Author(s):

J. Laird

Download Full-text

Can Proofs Be Animated By Games?

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

10.1007/11417170_3 ◽

2005 ◽

pp. 11-22 ◽

Author(s):

Susumu Hayashi

Download Full-text

A Feasible Algorithm for Typing in Elementary Affine Logic

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

10.1007/11417170_6 ◽

2005 ◽

pp. 55-70 ◽

Author(s):

Patrick Baillot ◽

Kazushige Terui

Keyword(s):

Feasible Algorithm

Download Full-text

Galois Embedding from Polymorphic Types into Existential Types

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

10.1007/11417170_15 ◽

2005 ◽

pp. 194-208 ◽

Author(s):

Ken-etsu Fujita

Download Full-text

Higher-Order Abstract Non-interference

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

10.1007/11417170_30 ◽

2005 ◽

pp. 417-432 ◽

Author(s):

Damiano Zanardini

Keyword(s):

Download Full-text