Theoretical Pearls:Representing ‘undefined’ in lambda calculus
From MaRDI portal
Publication:4764617
Recommendations
- scientific article; zbMATH DE number 6792351
- scientific article; zbMATH DE number 512777
- scientific article; zbMATH DE number 1114038
- The interpretation of unsolvable λ-terms in models of untyped λ-calculus
- Functional pearl: the distributive \(\lambda\)-calculus
- scientific article; zbMATH DE number 431764
- The Intensional Lambda Calculus
- scientific article; zbMATH DE number 2185665
- scientific article; zbMATH DE number 2079019
- Infinitary lambda calculus
Cites work
Cited in
(43)- A compact kernel for the calculus of inductive constructions
- Constructive proofs of the range property in lambda calculus
- Some new results on easy lambda-terms
- The expansion postponement in pure type systems
- On the number of types
- Fibrational modal type theory
- Enumerators of lambda terms are reducing constructively
- Towards a formal framework for heterogeneous relation algebra
- Substitution contradiction, its resolution and the Church-Rosser theorem in TIL
- Fixed point theorems for precomplete numberings
- A class of bounded functions, a database language and an extended lambda calculus
- On -definability of arithmetical functions with indeterminate values of arguments
- Graph easy sets of mute lambda terms
- A proof theoretic interpretation of model theoretic hiding
- On non-classical theory of computability
- scientific article; zbMATH DE number 1809599 (Why is no real title available?)
- Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
- The interpretation of unsolvable λ-terms in models of untyped λ-calculus
- scientific article; zbMATH DE number 1342220 (Why is no real title available?)
- Using formal methods with SysML in aerospace design and engineering
- scientific article; zbMATH DE number 1479633 (Why is no real title available?)
- GENERALIZATIONS OF THE RECURSION THEOREM
- A simple model construction for the calculus of constructions
- Theoretical PearlsEnumerators of lambda terms are reducing
- European Summer Meeting of the Association for Symbolic Logic
- Computability in partial combinatory algebras
- Böhm Reduction in Infinitary Term Graph Rewriting Systems
- Conflicting accounts of \(\lambda\)-definability
- Introduction to Type Theory
- Lambda-representable functions over term algebras
- To -define the computable functions without the fixed point operators
- Automated Reasoning
- scientific article; zbMATH DE number 6792351 (Why is no real title available?)
- Checking algorithms for Pure Type Systems
- Closure under alpha-conversion
- Communicating contexts: A pragmatic approach to information exchange
- An intuitionistic set-theoretical model of fully dependent CC
- Light genericity
- Some properties of precompletely and positively numbered sets
- Genericity through stratification
- Barendregt's theory of the -calculus, refreshed and formalized
- The noneffectivity of Arslanov's completeness criterion and related theorems
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
This page was built for publication: Theoretical Pearls:Representing ‘undefined’ in lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764617)