Sciweavers

374 search results - page 32 / 75
» Modular Semantics and Logics of Classes
Sort
View
PPDP
2007
Springer
14 years 2 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
PPDP
2007
Springer
14 years 2 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
AIML
2008
13 years 10 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto
PODS
1997
ACM
124views Database» more  PODS 1997»
14 years 26 days ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
LISP
2002
105views more  LISP 2002»
13 years 8 months ago
Specification Diagrams for Actor Systems
Abstract. Specification diagrams (SD's) are a novel form of graphical notation for specifying open distributed object systems. The design goal is to define notation for specif...
Scott F. Smith, Carolyn L. Talcott