Sciweavers

265 search results - page 25 / 53
» entcs 2007
Sort
View
120
Voted
ENTCS
2007
80views more  ENTCS 2007»
14 years 10 months ago
Topological Perspective on the Hybrid Proof Rules
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
Balder ten Cate, Tadeusz Litak
99
Voted
ENTCS
2007
102views more  ENTCS 2007»
14 years 10 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
ENTCS
2007
107views more  ENTCS 2007»
14 years 10 months ago
Applications = Components + GLoo
We are advocating a component-oriented software development approach that provides support for a clear separation between the computational and the compositional entities of an ap...
Markus Lumpe
ENTCS
2007
107views more  ENTCS 2007»
14 years 10 months ago
Executable Grammars in Newspeak
We describe the design and implementation of a parser combinator library in Newspeak, a new language in the Smalltalk family. Parsers written using our library are remarkably simi...
Gilad Bracha
ENTCS
2007
92views more  ENTCS 2007»
14 years 10 months ago
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
Clemens Grabmayer