Sciweavers

1027 search results - page 40 / 206
» Language Support for Connector Abstractions
Sort
View
POPL
1998
ACM
14 years 1 days ago
From System F to Typed Assembly Language
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...
PPCP
1993
13 years 12 months ago
Higher-Order Logic Programming as Constraint Logic Programming
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 ...
Spiro Michaylov, Frank Pfenning
MLG
2007
Springer
14 years 1 months ago
A Universal Kernel for Learning Regular Languages
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...
Leonid Kontorovich
OWLED
2008
13 years 9 months ago
The OWL in the CASL - Designing Ontologies Across Logics
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...
Oliver Kutz, Dominik Lücke, Till Mossakowski,...
SIGADA
2005
Springer
14 years 1 months ago
The implementation of ada 2005 synchronized interfaces in the GNAT compiler
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...