Sciweavers

IJCAI
2001
13 years 5 months ago
SiN: Integrating Case-based Reasoning with Task Decomposition
This paper describes SiN, a novel case-based planning algorithm that combines conversational case retrieval with generative planning. SiN is provably correct, and can generate pla...
Héctor Muñoz-Avila, David W. Aha, Da...
DAGSTUHL
2006
13 years 5 months ago
A convenient category of domains
We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual -continuous dcppos of domain theory. Our category su...
Ingo Battenfeld, Matthias Schröder, Alex Simp...
LICS
1991
IEEE
13 years 8 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002
MFCS
1993
Springer
13 years 8 months ago
Real Number Computability and Domain Theory
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
Pietro Di Gianantonio
TAPSOFT
1997
Springer
13 years 8 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
FOSSACS
1998
Springer
13 years 8 months ago
Generalizing Domain Theory
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
Michael W. Mislove
KBSE
1998
IEEE
13 years 8 months ago
Explaining Synthesized Software
Motivated by NASA's need for high-assurance software, NASA Ames' Amphion project has developed a generic program generation system based on deductive synthesis. Amphion ...
Jeffrey Van Baalen, Peter Robinson, Michael R. Low...
IFIP
2004
Springer
13 years 10 months ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli
LICS
2005
IEEE
13 years 10 months ago
Name Generation and Linearity
A path-based domain theory for higher-order processes is extended to allow name generation. The original domain theory is built around the monoidal-closed category Lin consisting ...
Glynn Winskel
CSL
2009
Springer
13 years 11 months ago
Nominal Domain Theory for Concurrency
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...
David Turner, Glynn Winskel