Encoding Types in ML-like Languages (Preliminary Version)
نویسندگان
چکیده
منابع مشابه
Encoding Types in ML - like Languages ( Preliminary
A Hindley-Milner type system such as ML’s seems to prohibit typeindexed values, i.e., functions that map a family of types to a family of values. Such functions generally perform case analysis on the input types and return values of possibly different types. The goal of our work is to demonstrate how to program with type-indexed values within a Hindley-Milner type system. Our first approach is ...
متن کاملVarieties and covarieties of languages ( preliminary version )
Because of the isomorphism (X × A) → X ∼= X → (A → X), the transition structure of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. This algebra-coalgebra duality goes back to Arbib and Manes, who formulated it as a duality between reachability and observability, and is ultimately based on Kalman’s duality in syst...
متن کاملHoots99 Preliminary Version a Modular Sos for Ml Concurrency Primitives
Modularity is an important pragmatic aspect of semantic descriptions. In denota-tional semantics, the issue of modularity has received much attention, and appropriate abstractions have been introduced, so that deenitions of semantic functions may be independent of the details of how computations are modelled. In structural operational semantics (SOS), however, this issue has largely been neglec...
متن کاملJust: Safe Unknown Types in Java-like Languages
Most mainstream object-oriented languages, like C++, Java and C#, are statically typed. In recent years, untyped languages, in particular scripting languages for the web, have gained a lot of popularity notwithstanding the fact that the advantages of static typing, such as earlier detection of errors, are widely accepted. We think that one of the main reasons for their widespread adoption is th...
متن کاملTypes for Web Rule Languages: a preliminary study
We survey and analyse the relevant existing work on typing of rules, in particular on typing of constraint logic programs and discuss applicability of these approaches to the REWERSE reasoning and query languages under development by WG I1 and by WG I4. This is related to WG I1, developing logic programming like languages for reasoning on the web and with WG I4 investigating development of decl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1998
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v5i9.19281