Sciweavers

1763 search results - page 264 / 353
» A Formalization of Polytime Functions
Sort
View
ICFP
2007
ACM
15 years 9 months ago
Type-safe higher-order channels in ML-like languages
As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form of task parallelism in parallel computations. ...
Sungwoo Park
ICFP
2005
ACM
15 years 9 months ago
A principled approach to operating system construction in Haskell
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
Thomas Hallgren, Mark P. Jones, Rebekah Leslie, An...
ICFP
2002
ACM
15 years 9 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
ICFP
2001
ACM
15 years 9 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
ICWS
2009
IEEE
15 years 7 months ago
Integrating Behavioral Trust in Web Service Compositions
Algorithms for composing Web services (WS) traditionally utilize the functional and quality-of-service parameters of candidate services to decide which services to include in the ...
Sharon Paradesi, Prashant Doshi, Sonu Swaika