The following pages link to (Q4722037):
Displaying 50 items.
- A type-theoretic approach to program development (Q2277827) (← links)
- Formal metatheory of the lambda calculus using Stoughton's substitution (Q2358702) (← links)
- Higher-order unification via combinators (Q2367541) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Abstraction in algorithmic logic (Q2481241) (← links)
- A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG (Q2493750) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Construction of the model of the lambda calculus system with algebraic operators (Q2639045) (← links)
- Combinatory logic and the semantics of substructural logics (Q2642518) (← links)
- The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL (Q2900507) (← links)
- The representational adequacy of <scp>Hybrid</scp> (Q3008233) (← links)
- Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming (Q3067475) (← links)
- π-RED<sup>+</sup> An interactive compiling graph reduction system for an applied λ-calculus (Q3125230) (← links)
- Extending the first-order theory of combinators with self-referential truth (Q3138009) (← links)
- The Senses of Functions in the Logic of Sense and Denotation (Q3161628) (← links)
- A combinatory account of internal structure (Q3173527) (← links)
- BUNDER’S PARADOX (Q3389494) (← links)
- On adding (<i>ξ</i>) to weak equality in combinatory logic (Q3480014) (← links)
- Principal type-schemes and condensed detachment (Q3489979) (← links)
- (Q3522248) (← links)
- A Nominal Axiomatization of the Lambda Calculus (Q3553919) (← links)
- An Introduction to the Lambda Calculus (Q3599178) (← links)
- Abstract λ-Calculus Machines (Q3599179) (← links)
- Proposal for a natural formalization of functional programming concepts (Q3793721) (← links)
- Constructive natural deduction and its ‘ω-set’ interpretation (Q4006232) (← links)
- Systems of illative combinatory logic complete for first-order propositional and predicate calculus (Q4276020) (← links)
- Uniqueness of normal proofs of minimal formulas (Q4276021) (← links)
- Algebra of constructions II: an algebraic approach to Martin-Löf type theory and the calculus of constructions (Q4279249) (← links)
- From operational semantics to abstract machines (Q4279254) (← links)
- Categorical models for non-extensional λ-calculi and combinatory logic (Q4279260) (← links)
- Alonzo church:his life, his work and some of his miracles (Q4391354) (← links)
- The lambda calculus and adjoint functors (Q4428877) (← links)
- Higher-Order Multi-Valued Resolution (Q4443416) (← links)
- The Church-Rosser property in dual combinatory logic (Q4457728) (← links)
- On the role of implication in formal logic (Q4527912) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- Collapsing partial combinatory algebras (Q4645804) (← links)
- Structuring metatheory on inductive definitions (Q4647512) (← links)
- Decidability of all minimal models (Q4647581) (← links)
- 2002–2003 Winter Meeting of the Association for Symbolic Logic (Q4650300) (← links)
- (Q4680256) (← links)
- Quantifier elimination and parametric polymorphism in programming languages (Q4763983) (← links)
- The complexity of type inference for higher-order typed lambda calculi (Q4764610) (← links)
- The Mathematical Work of S.C.Kleene (Q4837673) (← links)
- Weak polymorphism can be sound (Q4880527) (← links)
- Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them (Q4911148) (← links)
- Some results on combinators in the system TRC (Q4948544) (← links)
- Call-by-value Solvability (Q4953339) (← links)
- (Q4991956) (← links)
