Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
85 | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
An Analysis of ML Typability. |
J. ACM |
1994 |
DBLP DOI BibTeX RDF |
acyclic semi-unification, semi-unification, ML |
85 | Harry G. Mairson |
Deciding ML Typability is Complete for Deterministic Exponential Time. |
POPL |
1990 |
DBLP DOI BibTeX RDF |
ML |
85 | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
ML Typability is DEXTIME-Complete. |
CAAP |
1990 |
DBLP DOI BibTeX RDF |
|
67 | Tachio Terauchi, Alex Aiken |
On Typability for Rank-2 Intersection Types with Polymorphic Recursion. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
67 | Stijn Vansummeren |
On the complexity of deciding typability in the relational algebra. |
Acta Informatica |
2005 |
DBLP DOI BibTeX RDF |
|
67 | Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells |
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). |
ICFP |
1999 |
DBLP DOI BibTeX RDF |
|
56 | A. J. Kfoury, J. B. Wells |
A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. |
LISP and Functional Programming |
1994 |
DBLP DOI BibTeX RDF |
ML |
38 | Henning Makholm, J. B. Wells |
Type inference, principal typings, and let-polymorphism for first-class mixin modules. |
ICFP |
2005 |
DBLP DOI BibTeX RDF |
mixin modules, record concatenation, row unification, type systems, polymorphism |
38 | Ken-etsu Fujita, Aleksy Schubert |
Partially Typed Terms between Church-Style and Curry-Style. |
IFIP TCS |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Sophie Malecki |
Proofs in System Fomega Can Be Done in System Fomega1. |
CSL |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Jan Van den Bussche, Stijn Vansummeren |
Polymorphic type inference for the named nested relational calculus. |
ACM Trans. Comput. Log. |
2007 |
DBLP DOI BibTeX RDF |
named nested relational calculus, typability, complexity, Type inference |
31 | Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren |
A crash course on database queries. |
PODS |
2007 |
DBLP DOI BibTeX RDF |
nested relational calculus, runtime error, typability, well-definedness, reflection, type system, type inference, XQuery, relational algebra |
31 | Corrado Böhm |
Subduing Self-Application. |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
combinatory and lambda-algebras, typability, strong normalizability, recursor, permutator, iterator, Self-application, recursive schemes |
29 | Gilles Dowek |
The Undecidability of Typability in the Lambda-Pi-Calculus. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
29 | M. Clarence Protin, Gilda Ferreira |
Typability and Type Inference in Atomic Polymorphism. |
Log. Methods Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
29 | M. Clarence Protin, Gilda Ferreira |
Typability and Type Inference in Atomic Polymorphism. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
29 | Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca |
Solvability = Typability + Inhabitation. |
Log. Methods Comput. Sci. |
2021 |
DBLP BibTeX RDF |
|
29 | Andrej Dudenhefner |
The Undecidability of System F Typability and Type Checking for Reductionists. |
LICS |
2021 |
DBLP DOI BibTeX RDF |
|
29 | Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca |
Observability = Typability + Inhabitation. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
29 | Andrej Dudenhefner, Jakob Rehof |
Typability in bounded dimension. |
LICS |
2017 |
DBLP DOI BibTeX RDF |
|
29 | Paolo Pistone |
On Dinaturality, Typability and beta-eta-Stable Models. |
FSCD |
2017 |
DBLP DOI BibTeX RDF |
|
29 | Herman Geuvers, Robbert Krebbers |
The correctness of Newman's typability algorithm and some of its extensions. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
29 | Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano |
Type checking and typability in domain-free lambda calculi. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
29 | Inge Bethke, Piet Rodenburg |
Typability in Partial Applicative Structures. |
J. Log. Lang. Inf. |
2011 |
DBLP DOI BibTeX RDF |
|
29 | J. Roger Hindley |
M. H. Newman's Typability Algorithm for Lambda-calculus. |
J. Log. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Yuxin Deng, Davide Sangiorgi |
Ensuring termination by typability. |
Inf. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Yuxin Deng, Davide Sangiorgi |
Ensuring Termination by Typability. |
IFIP TCS |
2004 |
DBLP DOI BibTeX RDF |
|
29 | J. B. Wells |
Typability and Type Checking in System F are Equivalent and Undecidable. |
Ann. Pure Appl. Log. |
1999 |
DBLP DOI BibTeX RDF |
|
29 | A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn |
Alpha-Conversion and Typability. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
29 | Marcin Benke |
An Algebraic Characterization of Typability in ML with Subtyping. |
FoSSaCS |
1999 |
DBLP DOI BibTeX RDF |
|
29 | Silvia Ghilezan |
Strong Normalization and Typability with Intersection Types. |
Notre Dame J. Formal Log. |
1996 |
DBLP DOI BibTeX RDF |
|
29 | J. B. Wells |
Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and Undecidable |
LICS |
1994 |
DBLP DOI BibTeX RDF |
|
29 | Gilles Dowek |
The Undecidability of Typability in the Lambda-Pi-Calculus. |
TLCA |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Dennis M. Volpano, Geoffrey S. Smith |
On the Complexity of ML Typability with Overloading. |
FPCA |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Ken-etsu Fujita, Aleksy Schubert |
Existential Type Systems with No Types in Terms. |
TLCA |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Cédric Fournet, Tamara Rezk |
Cryptographically sound implementations for typed information-flow security. |
POPL |
2008 |
DBLP DOI BibTeX RDF |
probabilistic programs, cryptography, compilers, integrity, type systems, computational model, confidentiality, non-interference, secure information flow |
19 | James Cheney |
FLUX: functional updates for XML. |
ICFP |
2008 |
DBLP DOI BibTeX RDF |
update languages, XML, static analysis, type systems |
19 | Simon J. Gay, Malcolm Hole |
Subtyping for session types in the pi calculus. |
Acta Informatica |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Neal Glew, Jens Palsberg, Christian Grothoff |
Type-Safe Optimisation of Plugin Architectures. |
SAS |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Nobuko Yoshida |
Channel dependent types for higher-order mobile processes. |
POPL |
2004 |
DBLP DOI BibTeX RDF |
the higher-order ?-calculus, access control, types, secrecy, mobile processes |
19 | Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn |
Type Inference for Nested Self Types. |
TYPES |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Sandra Alves, Mário Florido |
Linearization by Program Transformation. |
LOPSTR |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Neal Glew, Jens Palsberg |
Type-Safe Method Inlining. |
ECOOP |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Olaf Chitil |
Type Inference Builds a Short Cut to Deforestation. |
ICFP |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Marcin Benke |
Predicative Polymorphic Subtyping. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Joëlle Despeyroux, Pierre Leleu |
A Modal Lambda Calculus with Iteration and Case Constructs. |
TYPES |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Jeffrey M. Bell, Françoise Bellegarde, James Hook |
Type-Driven Defunctionalization. |
ICFP |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Patrick Lincoln, John C. Mitchell |
Algorithmic Aspects of Type Inference with Subtypes. |
POPL |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Michael I. Schwartzbach |
Type Inference with Inequalities. |
TAPSOFT, Vol.1 |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Hans Leiß |
Polymorphic Recursion and Semi-Unification. |
CSL |
1989 |
DBLP DOI BibTeX RDF |
|