3931 search results - page 127 / 787 » Separation logic and abstraction |
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
TPHOL
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
LICS
1996
IEEE
15 years 2 months ago
1996
IEEE
We present the linear type theory LLF as the forThis extended abstract will appear on the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science -LICS'...
CIE
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset. The connection with the notions of fuzzy Turing machi...
CSL
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...