Sciweavers

1076 search results - page 81 / 216
» Operations on proofs and labels
Sort
View
CSL
2009
Springer
16 years 4 days ago
Decidable Extensions of Church's Problem
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
Alexander Rabinovich
COLCOM
2008
IEEE
16 years 1 days ago
An Undo Framework for P2P Collaborative Editing
Abstract. Existing Peer to Peer (P2P) collaborative editing systems do not allow any user to undo any modification. However, in such systems, users are not aware of others’ modi...
Stéphane Weiss, Pascal Urso, Pascal Molli
163
Voted
IFM
2007
Springer
15 years 11 months ago
Unifying Theories of Objects
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
Michael Anthony Smith, Jeremy Gibbons
MPC
2004
Springer
109views Mathematics» more  MPC 2004»
15 years 11 months ago
Optimizing Generic Functions
Abstract. Generic functions are defined by induction on the structural representation of types. As a consequence, by defining just a single generic operation, one acquires this o...
Artem Alimarine, Sjaak Smetsers
ESOP
2009
Springer
15 years 9 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts