scientific article; zbMATH DE number 7340562

MaRDI QIDQ4986735zbMATH OpenFDO

Authors Koji Nakazawa, Shin-ya Katsumata

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1210.3116, http://eptcs.web.cse.unsw.edu.au/paper.cgi?CLaC12.3

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Fundamental theorems of extensional untyped -calculus revisited
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• On the construction of stable models of untyped -calculus
• A category theoretic formulation for Engeler-style models of the untyped -calculus
• New proofs of important theorems of untyped extensional \(\lambda\) calculus
• The interpretation of unsolvable λ-terms in models of untyped λ-calculus
• Completeness of continuation models for \(\lambda_\mu\)-calculus
• scientific article; zbMATH DE number 883584
• scientific article; zbMATH DE number 2185665

Cited in

(8)

• Strong reduction of combinatory calculus with streams
• Completeness of continuation models for \(\lambda_\mu\)-calculus
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• Typing streams in the \({\Lambda}{\mu}\)-calculus
• A Filter Model for the λμ-Calculus
• A small model theorem for the hybrid  -calculus
• Reduction system for extensional lambda-mu calculus
• Innocent game models of untyped -calculus

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986735)