Sciweavers

3713 search results - page 118 / 743
» Constructing a Calculus of Programs
Sort
View
IAT
2009
IEEE
15 years 10 months ago
Modularity in BDI-Based Multi-agent Programming Languages
—This paper proposes a module-based vision for designing BDI-based multi-agent programming languages. The introduced concept of modules enables common programming techniques such...
Mehdi Dastani, Bas R. Steunebrink
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
15 years 8 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
TYPES
2000
Springer
15 years 6 months ago
A Tour with Constructive Real Numbers
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...
Alberto Ciaffaglione, Pietro Di Gianantonio
POPL
2009
ACM
16 years 3 months ago
Modeling abstract types in modules with open existential types
Abstract Types in Modules with Open Existential Types Beno?t Montagu Didier R?my INRIA {Benoit.Montagu, Didier.Remy}@inria.fr We propose F , a calculus of open existential types t...
Benoît Montagu, Didier Rémy
ICFP
2003
ACM
16 years 3 months ago
Disjunctive normal forms and local exceptions
All classical -terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact work...
Emmanuel Beffara, Vincent Danos