39 search results - page 6 / 8 » A Calculus for Type Predicates and Type Coercion |
ICFP
1999
ACM
13 years 11 months ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
CONSTRAINTS
2008
13 years 7 months ago
2008
Zinc is a new modelling language developed as part of the G12 project. It has four important characteristics. First, Zinc allows speci cation of models using a natural mathematical...
KR
2004
Springer
14 years 22 days ago
2004
Springer
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non...
ICALP
2010
Springer
14 years 5 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
TYPES
2004
Springer
14 years 21 days ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...