455 search results - page 71 / 91 » The Linear Logical Abstract Machine |
ERCIMDL
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Walden’s Paths is a suite of tools that supports the creation and presentation of linear hypermedia paths—targeted collections that enable authors to reorganize and c...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
107
click to vote
EON
2008
14 years 11 months ago
2008
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
124
click to vote
LICS
2012
IEEE
13 years 1 days ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
103
click to vote
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...