Sciweavers

3323 search results - page 107 / 665
» Computational Semantics with Functional Programming
Sort
View
FSTTCS
2008
Springer
14 years 11 months ago
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
Juan Rodríguez-Hortalá
MSCS
2006
89views more  MSCS 2006»
14 years 9 months ago
Quantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
Ellie D'Hondt, Prakash Panangaden
POPL
2008
ACM
15 years 10 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani
AMAST
1998
Springer
15 years 2 months ago
An Algebraic View of Program Composition
Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...
Pietro Cenciarelli
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 3 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet