scientific article; zbMATH DE number 7393563

zbMath1471.68055arXiv1309.1261MaRDI QIDQ4957787

Małgorzata Biernacka, Sergueï Lenglet, Marek Materzok, Dariusz Biernacki

Publication date: 9 September 2021

Full work available at URL: https://arxiv.org/abs/1309.1261

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong normalization proofs by CPS-translations
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• A syntactic approach to type soundness
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• A proof-theoretic foundation of abortive continuations
• Classical \(F_{\omega}\), orthogonality and symmetric candidates
• A Context-based Approach to Proving Termination of Evaluation
• The duality of computation
• Polymorphic Delimited Continuations
• Defunctionalized Interpreters for Call-by-Need Evaluation
• A new deconstructive logic: linear logic
• Proofs of strong normalisation for second order classical natural deduction
• An Operational Foundation for Delimited Continuations in the CPS Hierarchy
• Intensional interpretations of functionals of finite type I
• Operational interpretations of an extension of F_ω with control operators
• Typed Lambda Calculi and Applications