Sciweavers

1982 search results - page 94 / 397
» Parametricity and dependent types
Sort
View
CMSB
2006
Springer
15 years 8 months ago
Type Inference in Systems Biology
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
François Fages, Sylvain Soliman
CASES
2004
ACM
15 years 10 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
FUIN
2006
85views more  FUIN 2006»
15 years 4 months ago
Implementing Typeful Program Transformations
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
Chiyan Chen, Rui Shi, Hongwei Xi
ENTCS
2008
92views more  ENTCS 2008»
15 years 4 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
HASKELL
2006
ACM
15 years 10 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones