Sciweavers

95 search results - page 9 / 19
» Recursive Structures for Standard ML
Sort
View
ENTCS
2006
169views more  ENTCS 2006»
13 years 7 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
NECO
2006
111views more  NECO 2006»
13 years 7 months ago
Dynamics and Topographic Organization of Recursive Self-Organizing Maps
Recently, there has been an outburst of interest in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, at present, ...
Peter Tiño, Igor Farkas, Jort van Mourik
JCSS
2000
98views more  JCSS 2000»
13 years 7 months ago
Rooted Branching Bisimulation as a Congruence
This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote...
Wan Fokkink
IPL
2007
97views more  IPL 2007»
13 years 7 months ago
What is a free name in a process algebra?
There are two popular approaches to specifying the semantics of process algebras: labelled transition semantics and reaction semantics. While the notion of free name is rather unp...
Flemming Nielson, Hanne Riis Nielson, Henrik Pileg...
TPHOL
2005
IEEE
14 years 1 months ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier