Sciweavers

1763 search results - page 326 / 353
» A Formalization of Polytime Functions
Sort
View
71
Voted
ICFP
2006
ACM
15 years 9 months ago
Modelling deterministic concurrent I/O
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
Malcolm Dowse, Andrew Butterfield
ICFP
2005
ACM
15 years 9 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
ICFP
2003
ACM
15 years 9 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
82
Voted
ICFP
2003
ACM
15 years 9 months ago
A theory of aspects
This paper define the semantics of MinAML, an idealized aspect-oriented programming language, by giving a typedirected translation from its user-friendly external language to its ...
David Walker, Steve Zdancewic, Jay Ligatti
MOBIHOC
2007
ACM
15 years 9 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi