Sciweavers

248 search results - page 4 / 50
» Phantom types and subtyping
Sort
View
HASKELL
2008
ACM
15 years 2 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
TIM
2010
112views Education» more  TIM 2010»
14 years 8 months ago
Helmholtz-Type Regularization Method for Permittivity Reconstruction Using Experimental Phantom Data of Electrical Capacitance T
Electrical capacitance tomography (ECT) attempts to image the permittivity distribution of an object by measuring the electrical capacitance between sets of electrodes placed aroun...
Manuchehr Soleimani, Phaneendra K. Yalavarthy, Ham...
ICALP
1998
Springer
15 years 6 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
77
Voted
ENTCS
2006
116views more  ENTCS 2006»
15 years 1 months ago
Practical Datatype Specializations with Phantom Types and Recursion Schemes
Matthew Fluet, Riccardo Pucella
POPL
2010
ACM
15 years 11 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins