Sciweavers

258 search results - page 24 / 52
» Proof Styles in Operational Semantics
Sort
View
ESOP
2009
Springer
13 years 11 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
TGC
2007
Springer
14 years 1 months ago
Service Oriented Architectural Design
Abstract. We propose Architectural Design Rewriting (ADR), an approach to formalise the development and reconfiguration of software architectures based on term-rewriting. An archi...
Roberto Bruni, Alberto Lluch-Lafuente, Ugo Montana...
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 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
PPDP
2010
Springer
13 years 5 months ago
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
Thierry Martinez
FOSSACS
2004
Springer
14 years 27 days ago
Choice in Dynamic Linking
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...
Martín Abadi, Georges Gonthier, Benjamin We...