Continuation-passing style models complete for intuitionistic logic

This publication has 15 references indexed in Scilit:

• Delimited control operators prove Double-negation Shift
  Annals of Pure and Applied Logic, 2012
• Polymorphic Delimited Continuations
  2007
• Remarks on isomorphisms in typed lambda calculi with empty and sum types
  Annals of Pure and Applied Logic, 2006
• Krivine's intuitionistic proof of classical completeness (for countable languages)
  Annals of Pure and Applied Logic, 2004
• Normalization by evaluation for typed lambda calculus with coproducts
  2002
• Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
  The Bulletin of Symbolic Logic, 1996
• Tarski's High School Identities
  The American Mathematical Monthly, 1993
• An intuitiomstic completeness theorem for intuitionistic predicate logic
  The Journal of Symbolic Logic, 1976
• Call-by-name, call-by-value and the λ-calculus
  Theoretical Computer Science, 1975
• On weak completeness of intuitionistic predicate logic
  The Journal of Symbolic Logic, 1962