Sciweavers

4940 search results - page 264 / 988
» On the Complexity of Universal Programs
Sort
View
PPDP
2009
Springer
16 years 1 months ago
Session types for linear multithreaded functional programming
The construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on prec...
Vasco Thudichum Vasconcelos
PASTE
2010
ACM
15 years 10 months ago
The RoadRunner dynamic analysis framework for concurrent programs
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...
Cormac Flanagan, Stephen N. Freund
CADE
2004
Springer
16 years 6 months ago
Model Checking Using Tabled Rewriting
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
Zhiyao Liang
ICFP
2004
ACM
16 years 6 months ago
Numbering matters: first-order canonical forms for second-order recursive types
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
François Pottier, Nadji Gauthier
ITICSE
2006
ACM
16 years 16 days ago
High school computing clubs: a pilot study
While classes in IT skills are endemic, high school students in the UK rarely experience computer science. We present a pilot of a scheme that aims to go some way towards addressi...
Andrew Bennett, Joanna Briggs, Martyn Clark