Sciweavers

151 search results - page 11 / 31
» Examples of Program Composition Illustrating the Use of Univ...
Sort
View
POPL
2010
ACM
14 years 5 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
CEFP
2009
Springer
13 years 5 months ago
Reasoning about Codata
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...
Ralf Hinze
ICFP
2005
ACM
14 years 7 months ago
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
Martin Berger, Kohei Honda, Nobuko Yoshida
ZUM
2005
Springer
142views Formal Methods» more  ZUM 2005»
14 years 1 months ago
Formal Program Development with Approximations
Abstract. We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by reso...
Eerke A. Boiten, John Derrick
ICFP
2006
ACM
14 years 7 months ago
Transactional events
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
Kevin Donnelly, Matthew Fluet