Switch to: Citations

Add references

You must login to add references.
  1. Dynamic Logic.Lenore D. Zuck & David Harel - 1989 - Journal of Symbolic Logic 54 (4):1480.
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
  • Inductive types and type constraints in the second-order lambda calculus.Nax Paul Mendler - 1991 - Annals of Pure and Applied Logic 51 (1-2):159-172.
    Mendler, N.P., Inductive types and type constraints in the second-order lambda calculus, Annals of Pure and Applied Logic 51 159–172. We add to the second-order lambda calculus the type constructors μ and ν, which give the least and greatest solutions to positively defined type expressions. Strong normalizability of typed terms is shown using Girard's candidat de réductibilité method. Using the same structure built for that proof, we prove a necessary and sufficient condition for determining when a collection of equational type (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Algebra of Topology.J. C. C. Mckinsey & Alfred Tarski - 1944 - Annals of Mathematics, Second Series 45:141-191.
    Direct download  
     
    Export citation  
     
    Bookmark   129 citations  
  • Dynamic Logic.David Harel, Dexter Kozen & Jerzy Tiuryn - 2000 - MIT Press.
    This book provides the first comprehensive introduction to Dynamic Logic. Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic, and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   127 citations  
  • The combinatory foundations of mathematical logic.Haskell B. Curry - 1942 - Journal of Symbolic Logic 7 (2):49-64.
  • Combinatory Logic, Volume I.Haskell B. Curry, Robert Feys & William Craig - 1959 - Philosophical Review 68 (4):548-550.
  • The formulae-as-types notion of construction.William Alvin Howard - 1980 - In Haskell Curry, Hindley B., Seldin J. Roger & P. Jonathan (eds.), To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism. Academic Press.
    No categories
     
    Export citation  
     
    Bookmark   94 citations  
  • The formulæ-as-types notion of construction.W. A. Howard - 1995 - In Philippe De Groote (ed.), The Curry-Howard Isomorphism. Academia.
     
    Export citation  
     
    Bookmark   68 citations