The following pages link to (Q3997125):
Displaying 17 items.
- \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps (Q429596) (← links)
- Strong normalization from an unusual point of view (Q534700) (← links)
- Higher-order subtyping and its decidability (Q598199) (← links)
- Linearizing intuitionistic implication (Q1210141) (← links)
- Unification with extended patterns (Q1274966) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Synthesis of ML programs in the system Coq (Q1322847) (← links)
- Algebraic domains of natural transformations (Q1349657) (← links)
- Higher-order subtyping (Q1392282) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- Encoding Generic Judgments (Q2841234) (← links)
- The emptiness problem for intersection types (Q4934035) (← links)
- The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
- Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds (Q5311724) (← links)
- Least and greatest fixed points in intuitionistic natural deduction (Q5958300) (← links)
- Characterization of the principal type of normal forms in an intersection type system (Q6567783) (← links)
