Sciweavers

909 search results - page 117 / 182
» Generic Programming: An Introduction
Sort
View
ICLP
1991
Springer
15 years 2 months ago
Nonmonotonic Reasoning with Well Founded Semantics
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
Luís Moniz Pereira, Joaquim Nunes Apar&iacu...
APLAS
2008
ACM
15 years 1 months ago
Extensional Universal Types for Call-by-Value
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
Kazuyuki Asada
EUROPAR
2010
Springer
15 years 4 days ago
Exceptions for Algorithmic Skeletons
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
Mario Leyton, Ludovic Henrio, José M. Pique...
IEE
2008
100views more  IEE 2008»
14 years 11 months ago
Extending grammars and metamodels for reuse: the Reuseware approach
The trend toward domain-specific languages leads to an ever-growing plethora of highly specialized languages. Developers of such languages focus on their specific domains rather t...
Jakob Henriksson, Florian Heidenreich, Jendrik Joh...
ENTCS
2006
142views more  ENTCS 2006»
14 years 11 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu