Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Program synthesis by type-guided abstraction refinement
We consider the problem of type-directed component-based synthesis where, given a set of
(typed) components and a query type, the goal is to synthesize a term that inhabits the …
(typed) components and a query type, the goal is to synthesize a term that inhabits the …
Static type analysis by abstract interpretation of python programs
Python is an increasingly popular dynamic programming language, particularly used in the
scientific community and well-known for its powerful and permissive high-level syntax. Our …
scientific community and well-known for its powerful and permissive high-level syntax. Our …
Gradual type theory
Gradually typed languages are designed to support both dynamically typed and statically
typed programming styles while preserving the benefits of each. While existing gradual type …
typed programming styles while preserving the benefits of each. While existing gradual type …
Hazelnut: a bidirectionally typed structure editor calculus
Structure editors allow programmers to edit the tree structure of a program directly. This can
have cognitive benefits, particularly for novice and end-user programmers. It also simplifies …
have cognitive benefits, particularly for novice and end-user programmers. It also simplifies …
Gradual refinement types
Refinement types are an effective language-based verification technique. However, as any
expressive ty** discipline, its strength is its weakness, imposing sometimes undesired …
expressive ty** discipline, its strength is its weakness, imposing sometimes undesired …
Gradual ty**: a new perspective
We define a new, more semantic interpretation of gradual types and use it to``gradualize''two
forms of polymorphism: subty** polymorphism and implicit parametric polymorphism. In …
forms of polymorphism: subty** polymorphism and implicit parametric polymorphism. In …
Gradual ty** with union and intersection types
We propose a type system for functional languages with gradual types and set-theoretic type
connectives and prove its soundness. In particular, we show how to lift the definition of the …
connectives and prove its soundness. In particular, we show how to lift the definition of the …
The gradualizer: a methodology and algorithm for generating gradual type systems
Many languages are beginning to integrate dynamic and static ty**. Siek and Taha offered
gradual ty** as an approach to this integration that provides a coherent and full-span …
gradual ty** as an approach to this integration that provides a coherent and full-span …
Type-driven gradual security with references
In security-typed programming languages, types statically enforce noninterference between
potentially conspiring values, such as the arguments and results of functions. But to adopt …
potentially conspiring values, such as the arguments and results of functions. But to adopt …
On polymorphic gradual ty**
We study an extension of gradual ty**—a method to integrate dynamic ty** and static
ty** smoothly in a single language—to parametric polymorphism and its theoretical …
ty** smoothly in a single language—to parametric polymorphism and its theoretical …