Pages that link to "Item:Q4764617"

The following pages link to Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> (Q4764617):

Displaying 33 items.

• Graph easy sets of mute lambda terms (Q288793) (← links)
• Using formal methods with SysML in aerospace design and engineering (Q434438) (← links)
• Conflicting accounts of \(\lambda\)-definability (Q511925) (← links)
• The noneffectivity of Arslanov's completeness criterion and related theorems (Q781514) (← links)
• Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (Q880987) (← links)
• A compact kernel for the calculus of inductive constructions (Q1040007) (← links)
• Constructive proofs of the range property in lambda calculus (Q1314345) (← links)
• Some new results on easy lambda-terms (Q1314346) (← links)
• The expansion postponement in pure type systems (Q1375333) (← links)
• A conjecture on numeral systems (Q1381438) (← links)
• On the number of types (Q1708962) (← links)
• Fibrational modal type theory (Q1744413) (← links)
• Enumerators of lambda terms are reducing constructively (Q1891248) (← links)
• Towards a formal framework for heterogeneous relation algebra (Q1961865) (← links)
• Substitution contradiction, its resolution and the Church-Rosser theorem in TIL (Q2301323) (← links)
• Fixed point theorems for precomplete numberings (Q2311209) (← links)
• A class of bounded functions, a database language and an extended lambda calculus (Q2402281) (← links)
• On \(\lambda\)-definability of arithmetical functions with indeterminate values of arguments (Q2827607) (← links)
• A Proof Theoretic Interpretation of Model Theoretic Hiding (Q2890327) (← links)
• Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages (Q4236753) (← links)
• The interpretation of unsolvable <i>λ</i>-terms in models of untyped <i>λ</i>-calculus (Q4254697) (← links)
• GENERALIZATIONS OF THE RECURSION THEOREM (Q4647121) (← links)
• A simple model construction for the Calculus of Constructions (Q4647584) (← links)
• <i>Theoretical Pearls</i>Enumerators of lambda terms are reducing (Q4763984) (← links)
• European Summer Meeting of the Association for Symbolic Logic (Q4837676) (← links)
• COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS (Q4984865) (← links)
• Böhm Reduction in Infinitary Term Graph Rewriting Systems (Q5111303) (← links)
• Introduction to Type Theory (Q5191087) (← links)
• Automated Reasoning (Q5307081) (← links)
• (Q5369483) (← links)
• An intuitionistic set-theoretical model of fully dependent CC (Q6174091) (← links)
• Light genericity (Q6629516) (← links)
• Some properties of precompletely and positively numbered sets (Q6652036) (← links)