abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Abstract. In this paper, we show how the web ontology language OWL can be accommodated within the larger framework of the heterogeneous common algebraic specification language HETC...
One of the most important object-oriented features of the new revision of the Ada Programming Language is the introof Abstract Interfaces to provide a form of multiple nce. Ada 20...
Javier Miranda, Edmond Schonberg, Hristian Kirtche...