Sciweavers

1226 search results - page 69 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
ICALP
2010
Springer
15 years 8 months ago
On Bisimilarity and Substitution in Presence of Replication
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...
Daniel Hirschkoff, Damien Pous
BIRTHDAY
2006
Springer
15 years 7 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
JFPLC
2000
15 years 4 months ago
Preuves infinies en Programmation logique
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
Mathieu Jaume
TOOLS
1999
IEEE
15 years 7 months ago
Communication as a Means to Differentiate Objects, Components and Agents
the right abstractions is important for managing the complexity of your system. Three t abstractions used today are object, component and agent. Many similarities exist these abst...
Dwight Deugo, Franz Oppacher, Bruce Ashfield, Mich...
ECOOP
1995
Springer
15 years 6 months ago
Meta-level Programming with CodA
Abstract. Meta-levels are complex pieces of software with diverse demands in both the computation and interaction domains. Common techniques using just code to express behaviour fa...
Jeff McAffer