Sciweavers

660 search results - page 62 / 132
» The Implicit Calculus of Constructions
Sort
View
CONCUR
2007
Springer
14 years 3 months ago
Reactive Systems over Directed Bigraphs
We study the construction of labelled transition systems from reactive systems defined over directed bigraphs, a computational meta-model which subsumes other variants of bigraphs...
Davide Grohmann, Marino Miculan
TYPES
2004
Springer
14 years 2 months ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer
ICPADS
1996
IEEE
14 years 1 months ago
Transactional programming for distributed agent systems
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
V. K. Murthy
AMAST
2008
Springer
13 years 11 months ago
Simulation Using Orchestration
d Abstract) David Kitchin, Evan Powell, and Jayadev Misra The University of Texas at Austin The real world is inherently concurrent and temporal. For simulating physical phenomena ...
David Kitchin, Evan Powell, Jayadev Misra
CONCUR
2010
Springer
13 years 10 months ago
Termination in Impure Concurrent Languages
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...