Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
85 | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
An Analysis of ML Typability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(2), pp. 368-398, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
acyclic semi-unification, semi-unification, ML |
85 | Harry G. Mairson |
Deciding ML Typability is Complete for Deterministic Exponential Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, USA, January 1990, pp. 382-401, 1990, ACM Press, 0-89791-343-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
ML |
85 | A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn |
ML Typability is DEXTIME-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings, pp. 206-220, 1990, Springer, 3-540-52590-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
67 | Tachio Terauchi, Alex Aiken |
On Typability for Rank-2 Intersection Types with Polymorphic Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pp. 111-122, 2006, IEEE Computer Society, 0-7695-2631-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
67 | Stijn Vansummeren |
On the complexity of deciding typability in the relational algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 41(6), pp. 367-381, 2005. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), Paris, France, September 27-29, 1999., pp. 90-101, 1999, ACM, 1-58113-111-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LISP and Functional Programming ![In: Proceedings of the 1994 ACM Conference on LISP and Functional Programming, Orlando, Florida, USA, 27-29 June 1994., pp. 196-207, 1994, ACM, 0-89791-643-3. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
ML |
38 | Henning Makholm, J. B. Wells |
Type inference, principal typings, and let-polymorphism for first-class mixin modules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, September 26-28, 2005, pp. 156-167, 2005, ACM, 1-59593-064-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 505-520, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Sophie Malecki |
Proofs in System Fomega Can Be Done in System Fomega1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers, pp. 297-315, 1996, Springer, 3-540-63172-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Jan Van den Bussche, Stijn Vansummeren |
Polymorphic type inference for the named nested relational calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 9(1), pp. 3, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 143-154, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings, pp. 108-122, 1989, Springer, 3-540-51371-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.07599, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | M. Clarence Protin, Gilda Ferreira |
Typability and Type Inference in Atomic Polymorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 18(3), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | M. Clarence Protin, Gilda Ferreira |
Typability and Type Inference in Atomic Polymorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.13675, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
29 | Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca |
Solvability = Typability + Inhabitation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 17(1), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
29 | Andrej Dudenhefner |
The Undecidability of System F Typability and Type Checking for Reductionists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pp. 1-10, 2021, IEEE, 978-1-6654-4895-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
29 | Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca |
Observability = Typability + Inhabitation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.06009, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
29 | Andrej Dudenhefner, Jakob Rehof |
Typability in bounded dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pp. 1-12, 2017, IEEE Computer Society, 978-1-5090-3018-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
29 | Paolo Pistone |
On Dinaturality, Typability and beta-eta-Stable Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK, pp. 29:1-29:17, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-047-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
29 | Herman Geuvers, Robbert Krebbers |
The correctness of Newman's typability algorithm and some of its extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(28), pp. 3242-3261, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
29 | Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano |
Type checking and typability in domain-free lambda calculi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(44), pp. 6193-6207, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
29 | Inge Bethke, Piet Rodenburg |
Typability in Partial Applicative Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 20(2), pp. 161-168, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
29 | J. Roger Hindley |
M. H. Newman's Typability Algorithm for Lambda-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 18(2), pp. 229-238, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Yuxin Deng, Davide Sangiorgi |
Ensuring termination by typability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 204(7), pp. 1045-1082, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Yuxin Deng, Davide Sangiorgi |
Ensuring Termination by Typability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France, pp. 619-632, 2004, Kluwer/Springer, 1-4020-8140-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | J. B. Wells |
Typability and Type Checking in System F are Equivalent and Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 98(1-3), pp. 111-156, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
29 | A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn |
Alpha-Conversion and Typability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 150(1), pp. 1-21, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
29 | Marcin Benke |
An Algebraic Characterization of Typability in ML with Subtyping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structure, Second International Conference, FoSSaCS'99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings, pp. 104-119, 1999, Springer, 3-540-65719-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
29 | Silvia Ghilezan |
Strong Normalization and Typability with Intersection Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 37(1), pp. 44-52, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
29 | J. B. Wells |
Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and Undecidable ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), Paris, France, July 4-7, 1994, pp. 176-185, 1994, IEEE Computer Society, 0-8186-6310-3. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
29 | Gilles Dowek |
The Undecidability of Typability in the Lambda-Pi-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA '93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings, pp. 139-145, 1993, Springer, 3-540-56517-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Dennis M. Volpano, Geoffrey S. Smith |
On the Complexity of ML Typability with Overloading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPCA ![In: Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings, pp. 15-28, 1991, Springer, 3-540-54396-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Ken-etsu Fujita, Aleksy Schubert |
Existential Type Systems with No Types in Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings, pp. 112-126, 2009, Springer, 978-3-642-02272-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Cédric Fournet, Tamara Rezk |
Cryptographically sound implementations for typed information-flow security. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pp. 323-335, 2008, ACM, 978-1-59593-689-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP 2008, Victoria, BC, Canada, September 20-28, 2008, pp. 3-14, 2008, ACM, 978-1-59593-919-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 42(2-3), pp. 191-225, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Neal Glew, Jens Palsberg, Christian Grothoff |
Type-Safe Optimisation of Plugin Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings, pp. 135-154, 2005, Springer, 3-540-28584-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Nobuko Yoshida |
Channel dependent types for higher-order mobile processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004, pp. 147-160, 2004, ACM, 1-58113-729-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers, pp. 99-114, 2003, Springer, 3-540-22164-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Sandra Alves, Mário Florido |
Linearization by Program Transformation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers, pp. 160-175, 2003, Springer, 3-540-22174-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Neal Glew, Jens Palsberg |
Type-Safe Method Inlining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP 2002 - Object-Oriented Programming, 16th European Conference, Malaga, Spain, June 10-14, 2002, Proceedings, pp. 525-544, 2002, Springer, 3-540-43759-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Olaf Chitil |
Type Inference Builds a Short Cut to Deforestation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), Paris, France, September 27-29, 1999., pp. 249-260, 1999, ACM, 1-58113-111-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Marcin Benke |
Predicative Polymorphic Subtyping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 326-335, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Joëlle Despeyroux, Pierre Leleu |
A Modal Lambda Calculus with Iteration and Case Constructs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Workshop TYPES '98, Kloster Irsee, Germany, March 27-31, 1998, Selected Papers, pp. 47-61, 1998, Springer, 3-540-66537-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Jeffrey M. Bell, Françoise Bellegarde, James Hook |
Type-Driven Defunctionalization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), Amsterdam, The Netherlands, June 9-11, 1997., pp. 25-37, 1997, ACM, 0-89791-918-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Patrick Lincoln, John C. Mitchell |
Algorithmic Aspects of Type Inference with Subtypes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Albuquerque, New Mexico, USA, January 19-22, 1992, pp. 293-304, 1992, ACM Press, 0-89791-453-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Michael I. Schwartzbach |
Type Inference with Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'91), pp. 441-455, 1991, Springer, 3-540-53982-4. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Hans Leiß |
Polymorphic Recursion and Semi-Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings, pp. 211-224, 1989, Springer, 3-540-52753-2. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|