Pages that link to "Item:Q1079357"

The following pages link to Automatic synthesis of typed \(\Lambda\)-programs on term algebras (Q1079357):

Displaying 50 items.

• Preface to the special volume (Q534064) (← links)
• Comparing Hagino's categorical programming language and typed lambda- calculi (Q685425) (← links)
• On list primitive recursion and the complexity of computing inf (Q688724) (← links)
• Extensional models for polymorphism (Q749518) (← links)
• Functorial polymorphism (Q753948) (← links)
• \(\lambda\)-definability of free algebras (Q803116) (← links)
• The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
• Lambda calculus with patterns (Q930865) (← links)
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
• Metacircularity in the polymorphic \(\lambda\)-calculus (Q1177938) (← links)
• Recursive programming with proofs (Q1190480) (← links)
• Program morphisms (Q1203125) (← links)
• Structures definable in polymorphism (Q1273075) (← links)
• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
• Ordinals and ordinal functions representable in the simply typed lambda calculus (Q1302304) (← links)
• Formal parametric polymorphism (Q1314344) (← links)
• Functions over free algebras definable in the simply typed lambda calculus (Q1314357) (← links)
• Combining type disciplines (Q1319505) (← links)
• Equational programming in \(\lambda\)-calculus via SL-systems. Part 1 (Q1350516) (← links)
• Polynat in PER models (Q1434360) (← links)
• Incorporating quotation and evaluation into Church's type theory (Q1753993) (← links)
• Strong storage operators and data types (Q1805408) (← links)
• The Girard-Reynolds isomorphism (Q1887154) (← links)
• Algorithmically broad languages for polynomial time and space (Q2148807) (← links)
• Proofs for free (Q2844694) (← links)
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages (Q3644934) (← links)
• Complete Types in an Extension of the System <i>AF</i>2 (Q3647204) (← links)
• Two extensions of system F with (co)iteration and primitive (co)recursion principles (Q3653093) (← links)
• Constructive natural deduction and its ‘ω-set’ interpretation (Q4006232) (← links)
• An application of PER models to program extraction (Q4282806) (← links)
• Categorical data types in parametric polymorphism (Q4286531) (← links)
• The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) (← links)
• Push versus pull-based loop fusion in query engines (Q4577821) (← links)
• Defining data structures via Böhm-out (Q4836021) (← links)
• A CuCh Interpretation of an Object-Oriented Language1 1Partially supported by MURST Cofin '99 TOSCA. (Q4916176) (← links)
• Encoding many-valued logic in $\lambda$-calculus (Q5009711) (← links)
• Types as parameters (Q5044771) (← links)
• Parametricity of extensionally collapsed term models of polymorphism and their categorical properties (Q5096235) (← links)
• Intersection and union types (Q5096243) (← links)
• An extension of system F with subtyping (Q5096247) (← links)
• Many more predecessors: A representation workout (Q5110930) (← links)
• Introduction to Type Theory (Q5191087) (← links)
• LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS (Q5249246) (← links)
• Type Theories from Barendregt’s Cube for Theorem Provers (Q5251190) (← links)
• Efficiency of lambda-encodings in total type theory (Q5371961) (← links)
• The calculus of dependent lambda eliminations (Q5372010) (← links)
• Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism (Q5437034) (← links)
• Inductively defined types in the Calculus of Constructions (Q5887516) (← links)
• Algebraic types in PER models (Q5887524) (← links)
• Least and greatest fixed points in intuitionistic natural deduction (Q5958300) (← links)