1216 search results - page 5 / 244 » Hybrid type checking |
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
SFP
2001
13 years 10 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
POPL
1993
ACM
14 years 20 days ago
1993
ACM
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...
MJ
2006
13 years 8 months ago
2006
In this paper, we describe a hybrid tool for hardware formal verification that links the HOL (higher-order logic) theorem prover and (multiway decision graphs) model checker. Our ...