Sciweavers

1101 search results - page 57 / 221
» Forcing in proof theory
Sort
View
IFM
2007
Springer
14 years 4 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
LFCS
2009
Springer
14 years 2 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington
ICFP
1996
ACM
14 years 2 months ago
A Theory of Weak Bisimulation for Core CML
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
William Ferreira, Matthew Hennessy, Alan Jeffrey
ACL
1993
13 years 11 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
ENTCS
2007
96views more  ENTCS 2007»
13 years 10 months ago
An Observational Theory for Mobile Ad Hoc Networks
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Massimo Merro