Sciweavers

815 search results - page 84 / 163
» Algebraic Recognizability of Languages
Sort
View
LICS
1994
IEEE
15 years 10 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
VLDB
1994
ACM
128views Database» more  VLDB 1994»
15 years 10 months ago
From Nested-Loop to Join Queries in OODB
Most declarative SQL-like query languagesfor object-oriented database systems (OOSQL) are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-,...
Hennie J. Steenhagen, Peter M. G. Apers, Henk M. B...
DBPL
1991
Springer
76views Database» more  DBPL 1991»
15 years 9 months ago
A Functional DBPL Revealing High Level Optimizations
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
Martin Erwig, Udo W. Lipeck
MASCOTS
2003
15 years 7 months ago
PEPA Nets
Abstract. In this paper we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way...
Stephen Gilmore, Jane Hillston, Leïla Kloul
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 6 months ago
Programming an interpreter using molecular dynamics
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
Jan A. Bergstra, C. A. Middelburg