Haut PDF On the definition of lambda-calculus models

On the definition of lambda-calculus models
16

Incrementality and effect simulation in the simply typed lambda calculus
135

Full abstraction for the quantum lambda-calculus
29

Lambda theories of effective lambda models
16

Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
34

On the discriminating power of tests in resource lambda-calculus
11

Understanding untyped $\overline{\lambda}\mu\widetilde{\mu}$ calculus
16

Non-idempotent typing operators, beyond the lambda-calculus
370

Call-by-Value Lambda-calculus and LJQ
25

ASMs and Operational Algorithmic Completeness of Lambda Calculus
38

Algebras and Coalgebras in the Light Affine Lambda Calculus
13

Effective lambda-models vs recursively enumerable lambda-theories
35

Graph models of lambda-calculus at work, and variations
41

A lambda-calculus foundation for universal probabilistic programming
15

Fully Abstract Models of the Probabilistic λ-calculus
18

A call-by-name lambda-calculus machine
13

Metatheoretic Results for a Modal Lambda Calculus
42

A Lambda-calculus Structure Isomorphic to Gentzen-style Sequent Calculus Structure
16

A Proof of Weak Termination of the Simply-Typed {$\lambda\sigma$}-Calculus
17

Towards a lambda-calculus for concurrent and communicating systems
15