13734 search results - page 312 / 2747 » Abstractions of data types |
189
click to vote
ITP
2010
15 years 10 months ago
2010
Abstract. In order to make existing formalizations available for settheoretic developments, we present an automated translation of theories from Isabelle/HOL to Isabelle/ZF. This c...
155
click to vote
ASIAN
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We provide a formal definition of information flows in XML transformations and, more generally, in the presence of type driven computations and describe a sound technique...
173
click to vote
MCU
2001
15 years 8 months ago
2001
Abstract. A direct universal extended H system receives as input the coding of an extended H system with double splicing and simulates it. It is the first time that a direct constr...
171
click to vote
TCS
1998
15 years 6 months ago
1998
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
164
click to vote
ORDER
2007
15 years 6 months ago
2007
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....