Sciweavers

1321 search results - page 19 / 265
» Subtyping in Logical Form
Sort
View
78
Voted
FPCA
1989
15 years 1 months ago
F-Bounded Polymorphism for Object-Oriented Programming
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
Peter S. Canning, William R. Cook, Walter L. Hill,...
FCS
2006
14 years 11 months ago
The Representational Power of Conjunctive Normal Form
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
Thomas O'Neil, Jason Smith
87
Voted
ACRI
2004
Springer
15 years 2 months ago
Searching for Pattern-Forming Asynchronous Cellular Automata - An Evolutionary Approach
This paper discusses a class of 2-dimensional asynchronous cellular automata with conservation of mass, for the formation of patterns in groups. The previous study reported a metho...
Tomoaki Suzudo
WWW
2001
ACM
15 years 10 months ago
XML Query Forms (XQForms): Declarative Specification of XML Query Interfaces
XQForms is the first generator of Web-based query forms and reports for XML data. XQForms takes as input (i) XML Schemas that model the data to be queried and presented, (ii) decl...
Michalis Petropoulos, Vasilis Vassalos, Yannis Pap...
100
Voted
CADE
1990
Springer
15 years 1 months ago
IMPS: An Interactive Mathematical Proof System
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
William M. Farmer, Joshua D. Guttman, F. Javier Th...