Sciweavers

199 search results - page 7 / 40
» Combining Strict and Soft Typing in Functional Programming
Sort
View
PPDP
2010
Springer
14 years 8 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
86
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 9 months ago
A Logic Programming Framework for Combinational Circuit Synthesis
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
Paul Tarau, Brenda Luderman
PLDI
2010
ACM
15 years 7 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
103
Voted
POPL
1997
ACM
15 years 1 months ago
Pizza into Java: Translating Theory into Practice
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is d...
Martin Odersky, Philip Wadler
ESOP
2007
Springer
15 years 3 months ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...