Sciweavers

47 search results - page 2 / 10
» Type inference and strong static type checking for Promela
Sort
View
PLDI
2010
ACM
14 years 1 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
ICFP
2004
ACM
14 years 4 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
HASKELL
2006
ACM
13 years 10 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
CMSB
2006
Springer
13 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
DLS
2008
149views Languages» more  DLS 2008»
13 years 6 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani