11397 search results - page 116 / 2280 » A Relational Abstraction for Functions |
161
click to vote
CONSTRAINTS
2008
15 years 5 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
139
Voted
TCS
2008
15 years 4 months ago
2008
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
156
click to vote
JAR
2007
15 years 4 months ago
2007
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
151
click to vote
FAC
2000
15 years 4 months ago
2000
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
107
click to vote
FOSSACS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...