Patent
Bidirectional type checking for declarative data scripting language
David E. Langworthy,Gavin Bierman,Andrew D. Gordon,Donald F. Box,Bradford H. Lovering,Jeffrey C. Schlimmer,John D. Doty +6 more
- 03 Oct 2008
27
TL;DR: In this paper, an efficient, logical and expressive type system was proposed for the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members.
read more
Abstract: An efficient, logical and expressive type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. A bidirectional type checking algorithm is provided for the type system including synthesis and checking steps to statically verify types of code based on the type system.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Systems and methods for implementing an efficient, scalable homomorphic transformation of encrypted data with minimal data expansion and improved processing efficiency
Sherjil Ahmed
- 07 Nov 2017
TL;DR: Partially homomorphic encryption systems may be transformed into fully homomorphicryption systems that are scalable, rapid in translation speed, difficult to invert or break, capable of enabling various types of public and/or private key generation protocols and semantically secure.
70
Patent
Method and/or system for transforming between trees and strings
Jack J. Letourneau
- 04 Feb 2015
TL;DR: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed in this article, where the authors present a hierarchical set of data sets.
29
Patent
Enumeration of trees from finite number of nodes
Karl Schiffmann,Mark Andrews,Jack J. Letourneau +2 more
- 21 Nov 2013
TL;DR: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed in this paper, where the authors present a set of tools and techniques.
20
Patent
Optimizing program by reusing execution result of subclass test function
Takeshi Ogasawara
- 04 Sep 2012
TL;DR: In this paper, a technique for optimizing a program by reusing an execution result of a subclass test function is proposed, based on whether access to a global memory includes only access for reading out type information specified in a function call.
18
Patent
Method and/or system for manipulating tree expressions
Jack J. Letourneau
- 13 Oct 2009
TL;DR: A tree expression may represent information and/or data in one particular view among a plurality of views as mentioned in this paper, and a tree expression representing information and or data in a first view may be transformed or converted to another view which is different from the first view.
17
References
Refinement types for ML
Timothy S. Freeman,Frank Pfenning +1 more
- 01 May 1991
TL;DR: A type system called refinement types is described, which is an example of a new way to make this tradeoff, as well as a potentially useful system in itself.
Local type inference
TL;DR: Two partial type inference methods for a language combining subtyping and impredicative polymorphism are studied, both of which are local in the sense that missing annotations are recovered using only information from adjacent nodes in the syntax tree, without long-distance constraints such as unification variables.
286
Subtypes for specifications: predicate subtyping in PVS
TL;DR: A feature called "predicate subtyping" is described that uses type checking for the language to exploit the services of the theorem prover and its utility as mechanized in PVS is illustrated.
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
TL;DR: This work shows how to define a subtyped relation semantically in the presence of Boolean connectives, functional types and dynamic dispatch on types, without the complexity of denotational models, and how to derive a complete subtyping algorithm.
172
A type system for logic program
Eyal Yardeni,Ehud Shapiro +1 more
TL;DR: A theory for a type system for logic programs is developed which address the question of well-typing, type inference, and compile-time and run-time type checking, and a restricted class of types, called regular types, for which type checking is decidable.
148