Sciweavers

1226 search results - page 181 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
HASKELL
2007
ACM
15 years 7 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
POPL
2008
ACM
16 years 3 months ago
Multiparty asynchronous session types
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...
Kohei Honda, Nobuko Yoshida, Marco Carbone
OSDI
2008
ACM
16 years 3 months ago
Digging for Data Structures
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T....
ATAL
2007
Springer
15 years 9 months ago
ARTS: agent-oriented robust transactional system
This paper presents the ARTS (Agent-oriented Robust Transactional System) model, which applies transaction concepts to provide agent developers with high-level support for agent s...
Mingzhong Wang, Amy Unruh, Kotagiri Ramamohanarao
ESWS
2010
Springer
15 years 5 months ago
Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs
Abstract. Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely com...
Jörg Pührer, Stijn Heymans, Thomas Eiter