Adding Negation to Lambda Mu
From MaRDI portal
Publication:6135761
DOI10.46298/LMCS-19(2:12)2023arXiv2109.10447OpenAlexW3200172376MaRDI QIDQ6135761
No author found.
Publication date: 26 August 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.10447
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Proof assistants: history, ideas and future
- The revised report on the syntactic theories of sequential control and state
- A proof-theoretic foundation of abortive continuations
- A Constructive Proof of Dependent Choice, Compatible with Classical Logic
- Gentzen's Proof of Normalization for Natural Deduction
- On the Relations between the Syntactic Theories of λμ-Calculi
- Classical logic, continuation semantics and abstract machines
- Proofs of strong normalisation for second order classical natural deduction
- Characterisation of Normalisation Properties for λμ using Strict Negated Intersection Types
- Functionality in Combinatory Logic
- Idris, a general-purpose dependently typed programming language: Design and implementation
- A Machine-Oriented Logic Based on the Resolution Principle
- Intensional interpretations of functionals of finite type I
- Typed Lambda Calculi and Applications
This page was built for publication: Adding Negation to Lambda Mu