A typed, algebraic, computational lambda-calculus

DOI10.1017/S0960129512000205zbMath1312.03022OpenAlexW2027907817MaRDI QIDQ4917199

Benoît Valiron

Publication date: 29 April 2013

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129512000205

zbMATH Keywords

typed lambda-calculusalgebraic lambda-calculuscategorical framework for semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Polymorphic rewriting conserves algebraic strong normalization
• LCF considered as a programming language
• The differential lambda-calculus
• Order-incompleteness and finite lambda reduction models
• Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
• A Relational Model of a Parallel and Non-deterministic λ-Calculus
• The algebraic lambda calculus
• A Lambda Calculus for Quantum Computation
• Finiteness spaces