1070 search results - page 43 / 214 » Type Classes with Functional Dependencies |
HASKELL
2005
ACM
14 years 1 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
AML
1998
13 years 7 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
CDC
2009
IEEE
14 years 11 days ago
2009
IEEE
— This paper presents a sufficient condition that establishes closed loop stability for linear time invariant dynamical systems with transfer functions that are analytic in the ...
MJ
2006
13 years 7 months ago
2006
Organic Thin Film Transistors are a new class of sensors potentially capable of outperforming chemiresistors. They can be operated at room temperature, offer the advantage of rema...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...