, Type inclusion constraints and type inference, Proceedings of the Conference on Functional Programming Languages and Computer Architecture

. .. ///, Cited on pp

A. Aiken, E. L. Wimmers, and T. K. Lakshman, Soft typing with conditional types, Proceedings of the st -Symposium on Principles of Programming Languages, p.-

/. /. , Cited on p

, Semantic subtyping for imperative object-oriented languages, Proceedings of the International Conference on Object-Oriented Programming, Systems, Languages, and Applications

/. /. ,

P. Ângelo and M. Florido, Gradual intersection types, Workshop on Intersection Types and Related Systems

, The call-by-need lambda calculus, Journal of Functional Programming

Z. M. Ariola, J. Maraist, and M. Odersky, A call-by-need lambda calculus, Proceedings of the nd -Symposium on Principles of Programming Languages

F. Barbanera, M. Dezani-ciancaglini, and U. De'liguoro, Intersection and union types: syntax and semantics

H. Barendregt and M. Coppo, A lter lambda model and the completeness of type assignment, Journal of Symbolic Logic

V. Benzaken and G. Castagna, ¼Duce: an -centric general-purpose language, Proceedings of the th International Conference on Functional Programming

. .. ////, Cited on pp

V. Benzaken and G. Castagna, Static and dynamic semantics of NoSQL languages, Proceedings of the th Annual -Symposium on Principles of Programming Languages
URL : https://hal.archives-ouvertes.fr/hal-00797956

G. M. Bierman and M. Abadi, Understanding TypeScript. In: -Object-Oriented Programming

B. Bierman, M. Gavin, and E. Meijer, Lost in translation: formalizing proposed extensions to C, Proceedings of the nd Annual Conference on Object-oriented Programming Systems and Applications

. .. ///,

, Extensible programming with rst-class cases, Proceedings of the th International Conference on Functional Programming

/. /. , Cited on pp

J. Campora, S. Peter, M. Chen, and . Erwig, Migrating gradual types, Proceedings of the on Programming

, General recursion via coinductive types, Logical Methods in Computer Science Volume

, Soft typing, Proceedings of the Conference on Programming Language Design and Implementation. '''

/. /. , Cited on p

G. Castagna and R. De, Semantic subtyping for the pi-calculus, Theoretical Computer Science
URL : https://hal.archives-ouvertes.fr/hal-00148929

, A gentle introduction to semantic subtyping, Proceedings of the th International Conference on Principles and Practice of Declarative Programming

. .. ////, Cited on p

G. Castagna and H. Im, A core calculus for XQuery, Programming Languages and Systems
URL : https://hal.archives-ouvertes.fr/hal-01104872

G. Castagna, K. Nguy??nguy?-nguy??en, and Z. Xu, Polymorphic functions with set-theoretic types. Part : local type inference and type reconstruction, Proceedings of the nd AnnualSymposium on Principles of Programming Languages
URL : https://hal.archives-ouvertes.fr/hal-00880744

,. .. /// and ,. , Cited on pp

G. Castagna, K. Nguy??nguy?-nguy??en, and Z. Xu, Polymorphic functions with set-theoretic types. Part : syntax, semantics, and evaluation, Proceedings of the st -Symposium on Principles of Programming Languages
URL : https://hal.archives-ouvertes.fr/hal-00880744

/. /. ,

, Gradual typing with union and intersection types, Proceedings of the on Programming Languages

G. Castagna, V. Lanvin, and T. Petrucciani, Gradual typing: a new perspective, Proceedings of the on Programming Languages

G. Castagna and T. Petrucciani, Set-theoretic types for polymorphic variants, Proceedings of the st International Conference on Functional Programming
URL : https://hal.archives-ouvertes.fr/hal-01325644

/. /. ,

, Set-theoretic foundation of parametric polymorphism and subtyping, Proceedings of the th International Conference on Functional Programming

/. /. , Cited on pp

A. Chaudhuri, P. Vekris, and S. Goldman, Fast and precise type checking for JavaScript, Proceedings of the on Programming Languages

. Chugh, P. M. Ravi, and . Rondon, Nested reenements: a logic for duck typing, Proceedings of the th Annual Symposium on Principles of Programming Languages

/. /. , Cited on p

, The Gradualizer: a methodology and algorithm for generating gradual type systems, Proceedings of the rd Annual -Symposium on Principles of Programming Languages

. .. ///, Cited on p

, Partial objects in constructive type theory, Symposium on Logic in Computer Science (), p.pp

, An extension of the basic functionality theory for the ?-calculus, Notre Dame Journal of Formal Logic

O. Dardha and D. Gorla, Semantic subtyping for objects and classes, Formal Techniques for Distributed Systems
URL : https://hal.archives-ouvertes.fr/hal-00909299

, Practical reenement-type checking

, University of Cambridge

, Polymorphism, subtyping, and type inference in MLsub, Proceedings of the th Symposium on Principles of Programming Languages

, NixOS: a purely functional Linux distribution, Proceedings of the th International Conference on Bibliography Functional Programming

, A uniied system of type reenements

, Complete and easy bidirectional typechecking for higher-rank polymorphism, Proceedings of the th International Conference on Functional Programming

/. /. , Cited on p

, Type assignment for intersections and unions in call-by-value languages, Foundations of Software Science and Computation Structures

, Flow documentation

, Reenement types for ML, Proceedings of the Conference on Programming Language Design and Implementation

/. /. ,

, Théorie, conception et réalisation d'un langage de programmation adapté à

A. Frisch and G. Castagna, Semantic subtyping: dealing set-theoretically with function, union, intersection, and negation types, Journal
URL : https://hal.archives-ouvertes.fr/hal-00336120

,. Cited, ,. , ,. , ,. , ,. et al.,

, Type inference with subtypes

, Calculating threesomes, with blame, Proceedings of the th International Conference on Functional Programming

, Principal type schemes for gradual programs, Proceedings of the nd Annual -Symposium on Principles of Programming Languages

. .. ///, Cited on pp

R. Garcia and A. M. Clark, Abstracting Gradual Typing, Proceedings of the rd Annual -Symposium on Principles of Programming Languages

. .. ///, Cited on pp

, Simple type inference for structural polymorphism, International Workshop on Foundations of Object-Oriented Languages (

, A certiied implementation of ML with structural polymorphism and recursive types, In: Mathematical Structures in Computer Science

N. Gesbert and P. Genevès, Parametric polymorphism and semantic subtyping: the logical connection, Proceedings of the th International Conference on Functional Programming
URL : https://hal.archives-ouvertes.fr/inria-00585686

/. /. , Cited on pp

N. Gesbert and P. Genevès, A logical approach to deciding semantic subtyping, Transactions on Programming Languages and Systems
URL : https://hal.archives-ouvertes.fr/hal-00848023

, Dynamic typing: syntax and proof theory, Science of Computer Programming .., pp, p.-

H. Hosoya and A. Frisch, Parametric polymorphism for, Transactions on Programming Languages and Systems
URL : https://hal.archives-ouvertes.fr/hal-00152609

. .. ///, Cited on p

H. Hosoya and C. Benjamin, XDuce: a statically typed processing language, Trans. Internet Technol, p.pp

/. /. , Cited on pp

H. Hosoya, J. Vouillon, and C. Benjamin, Regular expression types for, Transactions on Programming Languages and Systems
URL : https://hal.archives-ouvertes.fr/hal-00009271

. .. ///, Cited on p

, Gradual typing for generics, Proceedings of the International Conference on Object Oriented Programming Systems Languages and Applications

/. /. , Cited on p

, Sums of uncertainty: reenements go gradual, Proceedings of the th Symposium on Principles of Programming Languages

, Kotlin documentation

, Principality and type inference for intersection types using expansion variables, Theoretical Computer Science

, The Ceylon language speciication, version

, Gradual reenement types, Proceedings of the th Symposium on Principles of Programming Languages

A. Maidl, F. Murbach, and . Mascarenhas, Typed Lua: an optional type system for Lua, Proceedings of the Workshop Bibliography on Dynamic Languages and Applications. Dyla'''

J. Maraist and M. Odersky, The call-by-need lambda calculus, Journal of Functional Programming

, An eecient uniication algorithm, Transactions on Programming Languages and Systems

/. /. , Cited on p

, The TypeScript handbook

, Uniication under a mixed preex, Journal of Symbolic Computation

, Type inference with simple subtypes, Journal of Functional Programming

, Empowering union and intersection types with integrated subtyping, Proceedings of the on Programming Languages

, Putting Type Annotations to Work, Proceedings of the rd -Symposium on Principles of Programming Languages

M. Odersky and C. Zenger, Colored local type inference, Proceedings of the th -Symposium on Principles of Programming Languages

. .. ////, Cited on p

, A polymorphic record calculus and its compilation, Transactions on Programming Languages and Systems .., pp, p.-

/. /. , Cited on p

, Purely Functional Data Structures

, Union and intersection types to support both dynamic and static typing, Information Processing Letters

, Sound and complete ow typing with unions, intersections and negations, Veriication, Model Checking, and Abstract Interpretation

, Whiley: a platform for research in software veriication, Software Language Engineering

P. Jones, D. Simon, S. Vytiniotis, and . Weirich, Practical type inference for arbitrary-rank types, In: Journal of Functional Programming

, Programming with intersection types and bounded polymorphism

, Types and programming languages

, Local type inference, Transactions on Programming Languages and Systems

. .. ///, Cited on pp

, Type inference in the presence of subtyping: from theory to practice

, Simplifying subtyping constraints: a theory. In: Information and Computation

, Unpublished draft of an extended version

, The essence of ML type inference, Advanced topics in types and programming languages

, The ins and outs of gradual type inference, Proceedings of the th AnnualSymposium on Principles of Programming Languages

/. /. , Cited on p

, Type checking records and variants in a natural extension of ML, -Symposium on Principles of Programming Languages

, Type inference for records in a natural extension of ML, Theoretical Aspects of Object-Oriented Programming. Types, Semantics and Language Design. Press

, Design of the programming language Forsythe, Algol-like languages. Birkhäuser

, Principal type scheme and uniication for intersection type discipline, Theoretical Computer Science

, Gradual typing for functional languages, Proceedings of Scheme and Functional Programming Workshop

, Gradual typing for objects, Proceedings of the st European Conference on Object-Oriented Programming

J. G. Siek and . Peter-thiemann, Blame and coercion: together again for the rst time, Proceedings of the th Conference on Programming Language Design and Implementation

/. /. ,

, Gradual typing with uniication-based inference, Proceedings of the Symposium on Dynamic Bibliography Languages. '''

J. G. Siek, M. Michael, M. Vitousek, and . Cimini, Reened criteria for gradual typing, Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik

N. Swamy, C. Fournet, A. Rastogi, K. Bhargavan, and J. Chen, Gradual typing embedded securely in JavaScript, Proceedings of the stSymposium on Principles of Programming Languages
URL : https://hal.archives-ouvertes.fr/hal-00940836

/. /. , Cited on p

, Interlanguage migration: from scripts to programs, Companion to the st Symposium on Object-oriented Programming Systems, Languages, and Applications. '''

, The design and implementation of Typed Scheme, Proceedings of the th AnnualSymposium on Principles of Programming Languages

/. /. , Cited on p

, Logical types for untyped languages, Proceedings of the th International Conference on Functional Programming

, A gradual interpretation of union types, Proceedings of the th Static Analysis Symposium

, Subtyping constrained types, Static Analysis

N. Vazou, E. L. Seidel, and R. Jhala, Reenement types for Haskell, Proceedings of the th International Conference on Functional Programming

. .. ///, Cited on p

, Well-typed programs can't be blamed, Proceedings of the th European Symposium on Programming

, A simple algorithm and proof for type inference, Fundamenta Informaticae

, A syntactic approach to type soundness, Information and Computation

N. Xie, X. Bi, and B. C. , Consistent subtyping for all. In: Programming Languages and Systems