Sciweavers

8109 search results - page 207 / 1622
» A Model of Component-Based Programming
Sort
View
ECOOP
1995
Springer
15 years 10 months ago
Meta-level Programming with CodA
Abstract. Meta-levels are complex pieces of software with diverse demands in both the computation and interaction domains. Common techniques using just code to express behaviour fa...
Jeff McAffer
WISES
2003
15 years 7 months ago
Logical versus Physical Programming for Ubiquitous Applications
— Ubiquitous computing provides services to users, according to their current situation. Interactions with such programs are as implicit as possible. We find among the applicati...
Julien Pauty, Michel Banâtre, Paul Couderc
IANDC
2006
78views more  IANDC 2006»
15 years 6 months ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr
TLCA
2007
Springer
16 years 12 days ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva