Weighted Relational Models of Typed Lambda-Calculi

DOI10.1109/LICS.2013.36zbMath1366.03171OpenAlexW2079873887MaRDI QIDQ5271067

Giulio Manzonetto, Guy McCusker, Michele Pagani, Jim Laird

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2013.36

zbMATH Keywords

lambda-calculus, linear logic, denotational semantics, quantitative semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40) Enriched categories (over closed or monoidal categories) (18D20) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (21)

Monoidal reverse differential categories ⋮ Taylor expansion, finiteness and strategies ⋮ Unnamed Item ⋮ Semantics of quantum programming languages: Classical control, quantum control ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Distributing and parallelizing non-canonical loops ⋮ A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces ⋮ Mackey-complete spaces and power series – a topological model of differential linear logic ⋮ Weighted models for higher-order computation ⋮ Intuitionistic fixed point logic ⋮ From Qualitative to Quantitative Semantics ⋮ Observed Communication Semantics for Classical Processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Convenient antiderivatives for differential linear categories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms ⋮ A Fresh Look at the λ-Calculus

This page was built for publication: Weighted Relational Models of Typed Lambda-Calculi