1096 search results - page 54 / 220 » Type inference for atomicity |
ACL
1994
13 years 10 months ago
1994
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
Environment classifiers were proposed as a new approach to typing multi-stage languages. Safety was established in the simply-typed and let-polymorphic settings. While the motivati...
ISIPTA
2005
IEEE
14 years 2 months ago
2005
IEEE
When considering sampling models described by a distribution from an exponential family, it is possible to create two types of imprecise probability models. One is based on the co...
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
TPHOL
2007
IEEE
14 years 3 months ago
2007
IEEE
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...