Sciweavers

Share
6 search results - page 1 / 2
» Undecidability of Type-Checking in Domain-Free Typed Lambda-...
Sort
View
CSL
2008
Springer
9 years 1 months ago
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
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...
Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama,...
WFLP
2009
Springer
244views Algorithms» more  WFLP 2009»
9 years 6 months ago
Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types
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...
Yuki Kato, Koji Nakazawa
ESOP
2012
Springer
7 years 7 months ago
Multiparty Session Types Meet Communicating Automata
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Pierre-Malo Deniélou, Nobuko Yoshida
ECOOP
2003
Springer
9 years 5 months ago
A Nominal Theory of Objects with Dependent Types
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...
Martin Odersky, Vincent Cremet, Christine Röc...
PPDP
2010
Springer
8 years 10 months ago
Type inference in intuitionistic linear logic
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...
Patrick Baillot, Martin Hofmann
books