Sciweavers

29 search results - page 3 / 6
» A Calculus of Untyped Aspect-Oriented Programs
Sort
View
CCA
2009
Springer
14 years 11 days ago
Realisability and Adequacy for (Co)induction
Abstract. We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped λ-ca...
Ulrich Berger
JUCS
2010
95views more  JUCS 2010»
13 years 17 days ago
Realisability for Induction and Coinduction with Applications to Constructive Analysis
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
Ulrich Berger
AOSD
2010
ACM
14 years 19 days ago
A theory of distributed aspects
Over the last five years, several systems have been proposed to take distribution into account in Aspect-Oriented Programming. While they appeared to be fruitful to develop or im...
Nicolas Tabareau
POPL
1997
ACM
13 years 10 months ago
Behavioral Equivalence in the Polymorphic Pi-calculus
We investigateparametric polymorphism in message-basedconcurrentprogramming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacal...
Benjamin C. Pierce, Davide Sangiorgi
KBSE
1997
IEEE
13 years 10 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell