منابع مشابه
Annotations for Intersection Typechecking
In functional programming languages, the classic form of annotation is a single type constraint on a term. Intersection types add complications: a single term may have to be checked several times against different types, in different contexts, requiring annotation with several types. Moreover, it is useful (in some systems, necessary) to indicate the context in which each such type is to be use...
متن کاملXML Typechecking
SYNONYMS None DEFINITION In general, typechecking refers to the problem where, given a program P , an input type σ, and an output type τ , one must decide whether P is type-safe, that is, whether it produces only outputs of type τ when run on inputs of type σ. In the XML context, typechecking problems mainly arise in two forms: • • XML-to-XML transformations, where P transforms XML documents co...
متن کاملTypechecking Z
This paper presents some of our requirements for a Z type-checker: that the typechecker accept all well-typeable formulations, however contrived; that it gather information about uses of declarations as needed to support interactive browsing and formal reasoning; that it t the description given by draft standard Z; and that it be able to check some particular extensions to Z that are intended t...
متن کاملNotable: At the Intersection of Annotations and Handheld Technology
The Notable annotation system enables users to annotate paper documents using handheld devices in a mobile environment. This paper describes the design issues and solutions that arose in creating Notable, with a particular focus on design challenges at the intersection of annotations and handheld technology. Novel design strategies include separating the annotation writing platform from the doc...
متن کاملOn Typechecking B
The typechecking system of the formal method B is discussed. An inconsistency in the public definition of the B method, attributable to a flaw in the typechecking system, is uncovered: the typechecking method expects the types of variables to be given in one membership predicate, such as a, b, c ∈ A × B × C, instead of with several membership predicates joined by conjunction, like a ∈ A∧b ∈ B∧c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.121.3