Now showing items 1-5 of 5
Monadic constraint programming
(Cambridge University Press, 2009)
A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls ...
The RPC Calculus
Several recent language designs have offered a unified language for programming a distributed system, with explicit notation of locations; we call these “location-aware” languages. These languages provide constructs ...
Threesomes, With and Without Blame
The blame calculus of Wadler and Findler gives a high-level semantics to casts in higher-order languages. The coercion calculus of Henglein, on the other hand, provides an instruction set for casts whose normal forms ...
Well-Typed Programs Can’t Be Blamed
We introduce the blame calculus, which adds the notion of blame from Findler and Felleisen’s contracts to a system similar to Siek and Taha’s gradual types and Flanagan’s hybrid types. We characterise where positive and ...
The Essence of Form Abstraction
Abstraction is the cornerstone of high-level programming; HTML forms are the principal medium of web interaction. However, most web programming environments do not support abstraction of form components, leading to a lack ...