6 search results - page 1 / 2 » Undecidability of Type-Checking in Domain-Free Typed Lambda-... |
CSL
2008
Springer
13 years 5 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...
WFLP
2009
Springer
13 years 11 months ago
2009
Springer
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reduci...
ESOP
2012
Springer
12 years 6 days ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
PPDP
2010
Springer
13 years 2 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
ECOOP
2003
Springer
13 years 9 months ago
2003
Springer
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...