1061 search results - page 89 / 213 » Dependently Sorted Logic |
SOFSEM
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
ASP
2003
Springer
14 years 3 months ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
FOSSACS
2003
Springer
14 years 3 months ago
2003
Springer
We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functiona...
ESOP
2008
Springer
13 years 11 months ago
2008
Springer
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
VL
1993
IEEE
14 years 2 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...