Sciweavers

143 search results - page 2 / 29
» Combining Logics in Simple Type Theory
Sort
View
ICFP
2006
ACM
14 years 5 months ago
Polymorphism and separation in hoare type theory
In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and Hoare Logic specifications into a unified framework. H...
Aleksandar Nanevski, Greg Morrisett, Lars Birkedal
CADE
2006
Springer
14 years 5 months ago
On the Strength of Proof-Irrelevant Type Theories
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
Benjamin Werner
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 5 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
POPL
2006
ACM
14 years 5 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke
PPDP
2007
Springer
13 years 11 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty