- On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic
2018/01/01 by Åukasz Lachowski · 1 citation
Computer Science · Mathematics · #Logic, programming, and type systems #Logic, Reasoning, and Knowledge #Advanced Algebra and Logic #Mathematics #Calculus (dental) #Lambda #Translation (biology) #Curry–Howard correspondence #Church encoding #Combinatory logic #Typed lambda calculus #Algebra over a field #Lambda calculus #Discrete mathematics #Simply typed lambda calculus #Computer science #Pure mathematics #Programming language
- Computational types from a logical perspective
1998/03/01 by P. N. Benton, Gavin Bierman, Valeria de Paiva · 2 citations
Computer Science · Mathematics · #Logic, programming, and type systems #Logic, Reasoning, and Knowledge #Advanced Algebra and Logic #Curry–Howard correspondence #Natural deduction #Cartesian closed category #Sequent calculus #Computer science #Calculus (dental) #Monad (category theory) #Lambda calculus #Intuitionistic logic #Typed lambda calculus #Confluence #Propositional calculus #Algebra over a field #Simply typed lambda calculus #Linear logic #Church encoding #Mathematics #Discrete mathematics #Programming language #Pure mathematics #Theoretical computer science