Sciweavers

163 search results - page 29 / 33
» PolyAML: a polymorphic aspect-oriented functional programmin...
Sort
View
GI
2009
Springer
14 years 2 days ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
SAIG
2001
Springer
13 years 12 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 7 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
SEFM
2007
IEEE
14 years 1 months ago
An AOP Extended Lambda-Calculus
This paper presents an implicitly-typed functional, aspect-oriented programming language: λ AOP. The main contribution of the paper is a semantics for λ AOP advice weaving. The ...
Dima Alhadidi, Nadia Belblidia, Mourad Debbabi, Pr...
ML
2006
ACM
103views Machine Learning» more  ML 2006»
14 years 1 months ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...