Hybrid type checking

By Cormac Flanagan. ACM-SIGACT Symposium on Principles of Programming Languages, 2006

316 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/f7344c91baba35ee091e362c00b21be49fab2c8e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Refinement types for Haskell (2014, methodology): “We prove the above following the overall recipe of [21].”
The ins and outs of gradual type inference (2012, methodology): “, via occurrence typing [22], gradual typing [16, 17], hybrid typing [8], and like typing [26].”
Gradual typing with unification-based inference (2008, methodology): “The later variantof SoftTypingby Flanagan and Felleisen [14]is anexample ofthis approach.”
Software model checking (2009, unknown): “Hybrid type checking [Flanagan 2006] provides a pragmatic compromise: one starts with an expressive dependent type system and tries to prove as many assertions as possible statically, inserting dynamic checks in the program for those assertions that cannot be proved statically.”
Gradual Typing for Objects (2007, methodology): “For example, casting at function types creates a wrapper function with the appropriate casts on the input and output [19, 20, 21, 48].”
Liquid types (2008, methodology): “Following [2, 10], our system allows base refinements of the form {ν :B | e}, where ν is a special value variable not appearing in the program, B is a base type and e is a boolean-valued expression constraining the value variable called the refinement predicate.”
The Design and Implementation of Typed Scheme: From Scripts to Programs (2011, unknown): “Since then, refinement types have been used in a wide variety of systems (Rondon et al, 2008; Wadler and Findler, 2009; Flanagan, 2006).”
Gradual Typing for Functional Languages (2006, methodology): “This rule is inspired by the work on semantic casts [13, 14, 15], though the rule may look slightly different because the casts used in this paper are annotated with the target type only and not also with the source type.”