Sciweavers

360 search results - page 14 / 72
» Dependently Typed Programming in Agda
Sort
View
HASKELL
2006
ACM
14 years 1 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
IJCAI
1993
13 years 9 months ago
A Parameterised Module System for Constructing Typed Logic Programs
The paper is concerned with the design of a module system for logic programming so as to satisfy many of the requirements of software en­ gineering. The design is based on the la...
Patricia M. Hill
ICFP
2005
ACM
14 years 7 months ago
Dynamic optimization for functional reactive programming using generalized algebraic data types
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...
Henrik Nilsson
MSCS
2008
87views more  MSCS 2008»
13 years 7 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo
ECOOP
2000
Springer
13 years 12 months ago
A Basic Model of Typed Components
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
João Costa Seco, Luís Caires