scientific article; zbMATH DE number 5852776
From MaRDI portal
Publication:3077958
zbMATH Open1347.03001MaRDI QIDQ3077958FDOQ3077958
Authors: Wil Dekkers, Henk Barendregt, Richard Statman 
Publication date: 18 February 2011
Title of this publication is not available (Why is that?)
Recommendations
- The lambda calculus. Its syntax and semantics. Rev. ed.
- scientific article; zbMATH DE number 4002064
- scientific article; zbMATH DE number 783760
- scientific article; zbMATH DE number 5318491
- scientific article; zbMATH DE number 2242116
- scientific article; zbMATH DE number 3875232
- scientific article; zbMATH DE number 4024773
- scientific article; zbMATH DE number 46869
- scientific article; zbMATH DE number 42059
- The Impact of the Lambda Calculus in Logic and Computer Science
Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Abstract and axiomatic computability and recursion theory (03D75)
Cited In (65)
- Clocks for Functional Programs
- Almost all Classical Theorems are Intuitionistic
- One or nothing: anti-unification over the simply-typed lambda calculus
- Node Replication: Theory And Practice
- Lower end of the linial-post spectrum
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Linear additives
- Rensets and renaming-based recursion for syntax with bindings extended version
- A type-based HFL model checking algorithm
- Canonicity of proofs in constructive modal logic
- Soundness conditions for big-step semantics
- When programs have to watch paint dry
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- Title not available (Why is that?)
- Title not available (Why is that?)
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
- A Computable Solution to Partee’s Temperature Puzzle
- Extensional higher-order paramodulation in Leo-III
- How to think of intersection types as Cartesian products
- Strong normalization through intersection types and memory
- The spirit of node replication
- Semantics of quantum programming languages: Classical control, quantum control
- Efficient type checking for path polymorphism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metric reasoning about \(\lambda\)-terms: the general case
- A coalgebraic view of bar recursion and bar induction
- From realizability to induction via dependent intersection
- First-order automated reasoning with theories: when deduction modulo theory meets practice
- Title not available (Why is that?)
- Nominal essential intersection types
- Combinatory logic with polymorphic types
- Typed path polymorphism
- De Bruijn's weak diamond property revisited
- Obituary: Nicolaas Govert de Bruijn (1918--2012). Mathematician, computer scientist, logician
- The new normal: we cannot eliminate cuts in coinductive calculi, but we can explore them
- Parametric Church's thesis: synthetic computability without choice
- On some enumerative problems in lambda calculus
- Title not available (Why is that?)
- COCHIS: stable and coherent implicits
- On sets of terms having a given intersection type
- A Generic Framework for Higher-Order Generalizations.
- On implicational intermediate logics axiomatizable by formulas minimal in classical logic: a counter-example to the Komori-Kashima problem
- Title not available (Why is that?)
- Composition and decomposition of multiparty sessions
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- Fixed points in lambda calculus. an eccentric survey of problems and solutions
- Type inference for rank-2 intersection types using set unification
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
- Levy labels and recursive types
- Strong typed Böhm theorem and functional completeness on the linear lambda calculus
- Automating free logic in HOL, with an experimental application in category theory
- Relational graph models at work
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- A coinductive approach to proof search through typed lambda-calculi
- Monotone recursive types and recursive data representations in Cedille
- Title not available (Why is that?)
- Agent-based HOL reasoning
- The Cooper storage idiom
- Type theory and formal proof. An introduction
- Title not available (Why is that?)
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- A characterization of lambda-terms transforming numerals
- Structural rules and algebraic properties of intersection types
- Types and programing languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077958)
