Sciweavers

446 search results - page 6 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
82
Voted
CLIMA
2010
14 years 11 months ago
Combining Logics in Simple Type Theory
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantif...
Christoph Benzmüller
79
Voted
CSL
2003
Springer
15 years 3 months ago
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This
Alexandre Miquel
70
Voted
TYPES
2007
Springer
15 years 4 months ago
Dependently Sorted Logic
Abstract. We propose syntax and semantics for systems of intuitionistic and classical first order dependently sorted logic, with and withlity, retaining type dependency, but other...
João Filipe Belo
80
Voted
ICFP
2003
ACM
15 years 10 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
85
Voted
JAPLL
2006
112views more  JAPLL 2006»
14 years 10 months ago
Intuitionistic hybrid logic
Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first const...
Torben Braüner, Valeria de Paiva