Sciweavers

PADL
2010
Springer
14 years 4 months ago
Similar Code Detection and Elimination for Erlang Programs
A well-known bad code smell in refactoring and software maintenance is duplicated code, that is the existence of code clones, which are code fragments that are identical or similar...
Huiqing Li, Simon Thompson
PLPV
2009
ACM
14 years 4 months ago
Type invariants for Haskell
Haskell’s multi-parameter type classes, together with functional dependencies, allow the specification of complex type-level opera
Tom Schrijvers, Louis-Julien Guillemette, Stefan M...
PLPV
2009
ACM
14 years 4 months ago
Verified programming in Guru
Aaron Stump, Morgan Deters, Adam Petcher, Todd Sch...
PLPV
2009
ACM
14 years 4 months ago
Embedding a logical theory of constructions in Agda
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
Ana Bove, Peter Dybjer, Andrés Sicard-Ram&i...
PLPV
2009
ACM
14 years 4 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
PLPV
2010
ACM
14 years 4 months ago
Singleton types here, singleton types there, singleton types everywhere
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
Stefan Monnier, David Haguenauer
PLPV
2010
ACM
14 years 4 months ago
Arity-generic datatype-generic programming
Some programs are doubly-generic. For example, map is datatypegeneric in that many different data structures support a mapping operation. A generic programming language like Gener...
Stephanie Weirich, Chris Casinghino
PLPV
2010
ACM
14 years 4 months ago
Resource typing in Guru
This paper presents a resource typing framework for the Guru d-programming language, in which abstractions for various kinds of program resources can be defined. Implemented exam...
Aaron Stump, Evan Austin
PLPV
2010
ACM
14 years 4 months ago
Free theorems for functional logic programs
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
Jan Christiansen, Daniel Seidel, Janis Voigtlä...
PLPV
2010
ACM
14 years 4 months ago
Modular reasoning about invariants over shared state with interposed data members
Reasoning about object-oriented programs is difficult since such programs usually involve aliasing, and it is not easy to identify the ways objects can relate to each other and t...
Stephanie Balzer, Thomas R. Gross