Sciweavers

632 search results - page 45 / 127
» Explicit Substitutions and Programming Languages
Sort
View
GPCE
2004
Springer
14 years 1 months ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen
POPL
2005
ACM
14 years 8 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna
ICFP
2005
ACM
14 years 7 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
AOSD
2007
ACM
13 years 11 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore
PADL
2000
Springer
13 years 11 months ago
Parallel Functional Reactive Programming
In this paper, we demonstrate how Functional Reactive Programming (FRP), a framework for the description of interactive systems, can be extended to encompass parallel systems. FRP ...
John Peterson, Valery Trifonov, Andrei Serjantov