Sciweavers

281 search results - page 49 / 57
» A formal framework for compositional compilation
Sort
View
POPL
1990
ACM
13 years 11 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
ECOOP
2003
Springer
14 years 26 days ago
A Calculus of Untyped Aspect-Oriented Programs
Abstract. Aspects have emerged as a powerful tool in the design and development of systems, allowing for the encapsulation of program transformations. The dynamic semantics of aspe...
Radha Jagadeesan, Alan Jeffrey, James Riely
POPL
1998
ACM
13 years 12 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
FMICS
2009
Springer
14 years 2 months ago
A Rigorous Methodology for Composing Services
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
Kenneth J. Turner, Koon Leai Larry Tan
ESWS
2005
Springer
14 years 1 months ago
Optimally Distributing Interactions Between Composed Semantic Web Services
When information services are organized to provide some composed functionality, their interactions can be formally represented as workflows. Traditionally, workflows are executed...
Ion Constantinescu, Walter Binder, Boi Faltings