Sciweavers

3440 search results - page 173 / 688
» Logics For Context-Free Languages
Sort
View
MST
2008
101views more  MST 2008»
15 years 7 months ago
Realizability interpretation of proofs in constructive analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
203
Voted
WWW
2005
ACM
16 years 7 months ago
OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic Web
The Semantic Web languages RDFS and OWL have been around for some time now. However, the presence of these languages has not brought the breakthrough of the Semantic Web the creat...
Axel Polleres, Dieter Fensel, Jos de Bruijn, Rub&e...
POPL
2003
ACM
16 years 7 months ago
Toward a foundational typed assembly language
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
Karl Crary
AGP
2010
IEEE
15 years 5 months ago
Concurrent and Reactive Constraint Programming
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
Maurizio Gabbrielli, Catuscia Palamidessi, Frank D...
179
Voted
ICFP
2006
ACM
16 years 7 months ago
Design patterns as higher-order datatype-generic programs
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...
Jeremy Gibbons