Sciweavers

2911 search results - page 282 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
APAL
2006
67views more  APAL 2006»
15 years 6 months ago
Pretopologies and a uniform presentation of sup-lattices, quantales and frames
We introduce the notion of infinitary preorder and use it to obtain a predicative presentation of sup-lattices by generators and relations. The method is uniform in that it extend...
Giulia Battilotti, Giovanni Sambin
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 6 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
ENTCS
2006
142views more  ENTCS 2006»
15 years 6 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 6 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
JMLR
2006
78views more  JMLR 2006»
15 years 6 months ago
Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...
Emanuel Kitzelmann, Ute Schmid