Decomposing typed lambda calculus into a couple of categorical programming languages

DOI10.1007/3-540-60164-3_28zbMath1502.68055OpenAlexW1762925969WikidataQ60019632 ScholiaQ60019632MaRDI QIDQ5057475

Masahito Hasegawa

Publication date: 16 December 2022

Published in: Category Theory and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60164-3_28

Mathematics Subject Classification ID

Theory of programming languages (68N15) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Reversible effects as inverse arrows ⋮ Modelling environments in call-by-value programming languages.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The categorical abstract machine
• A syntactic theory of sequential control
• The linear abstract machine
• Functional completeness of cartesian categories
• Sound and complete axiomatisations of call-by-value control operators
• Fibrations with indeterminates: contextual and functional completeness for polymorphic lambda calculi
• Explicit substitutions

This page was built for publication: Decomposing typed lambda calculus into a couple of categorical programming languages