Sciweavers

382 search results - page 60 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
ESOP
2004
Springer
14 years 1 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
EELC
2006
154views Languages» more  EELC 2006»
13 years 11 months ago
Unify and Merge in Fluid Construction Grammar
Research into the evolution of grammar requires that we employ formalisms and processing mechanisms that are powerful enough to handle features found in human natural languages. Bu...
Luc Steels, Joachim De Beule
AOSD
2007
ACM
13 years 11 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
OOPSLA
2009
Springer
14 years 2 months ago
Self type constructors
Bruce and Foster proposed the language LOOJ, an extension of Java with the notion of MyType, which represents the type of a self reference and changes its meaning along with inher...
Chieri Saito, Atsushi Igarashi
BSL
2004
110views more  BSL 2004»
13 years 7 months ago
Notes on quasiminimality and excellence
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
John T. Baldwin