Sciweavers

POPL
2009
ACM
15 years 15 days ago
Flexible types: robust type inference for first-class polymorphism
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...
Daan Leijen
POPL
2009
ACM
15 years 15 days ago
Static contract checking for Haskell
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
POPL
2009
ACM
15 years 15 days ago
Wild control operators
Linguists seek to understand the semantics of expressions in human languages. Taking a computational point of view, there are many natural language expressions--operators in the w...
Chris Barker
POPL
2009
ACM
15 years 15 days ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
PADL
2009
Springer
15 years 15 days ago
Toward a Practical Module System for ACL2
Abstract. Boyer and Moore's ACL2 theorem prover combines firstorder applicative Common Lisp with a computational, first-order logic. While ACL2 has become popular and is being...
Carl Eastlund, Matthias Felleisen
PADL
2009
Springer
15 years 15 days ago
Layered Models Top-Down Querying of Normal Logic Programs
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
Alexandre Miguel Pinto, Luís Moniz Pereira
PADL
2009
Springer
15 years 15 days ago
Declarative Network Verification
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg So...
PADL
2009
Springer
15 years 15 days ago
Ad Hoc Data and the Token Ambiguity Problem
Abstract. PADS is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data ...
Qian Xi, Kathleen Fisher, David Walker, Kenny Qili...
PADL
2009
Springer
15 years 15 days ago
Recycle Your Arrays!
Abstract. Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforest...
Roman Leshchinskiy
PADL
2009
Springer
15 years 15 days ago
Declarative Programming of User Interfaces
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
Christof Kluß, Michael Hanus