4617 search results - page 634 / 924 » Automation of Diagrammatic Reasoning |
192
click to vote
TPHOL
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract. We present a Coq formalization of constructive ω-cpos (extending earlier work by Paulin-Mohring) up to and including the inverselimit construction of solutions to mixed-...
233
Voted
TPHOL
2009
IEEE
16 years 2 months ago
2009
IEEE
We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semant...
210
Voted
TPHOL
2009
IEEE
16 years 2 months ago
2009
IEEE
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
308
click to vote
TPHOL
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract. We give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is based on Martin-L¨of’s intuitionistic t...
138
Voted
CSL
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. This paper investigates a non-commutative first-order sequent calculus NCLK. For that, this paper extends a non-commutative positive fragment to a full first-order sequ...