3342 search results - page 362 / 669 » Automating Abstract Interpretation |
173
click to vote
TPHOL
2009
IEEE
16 years 1 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-...
189
click to vote
TPHOL
2009
IEEE
16 years 1 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...
279
click to vote
TPHOL
2009
IEEE
16 years 1 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...
118
click to vote
CSL
2009
Springer
16 years 1 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...
185
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Classical Description Logics (DLs) are not suitable to represent vague pieces of information. The attempts to achieve a solution have lead to the birth of fuzzy DLs and r...