Sciweavers

2084 search results - page 190 / 417
» Set Constraints in Logic Programming
Sort
View
OOPSLA
2005
Springer
15 years 9 months ago
Generalized algebraic data types and object-oriented programming
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
Andrew Kennedy, Claudio V. Russo
ALP
1994
Springer
15 years 8 months ago
Compositional Analysis for Equational Horn Programs
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...
María Alpuente, Moreno Falaschi, Germ&aacut...
ICTAI
2007
IEEE
15 years 10 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
ECOOPW
1997
Springer
15 years 8 months ago
Semantics Through Pictures
An object-oriented (OO) model has a static component, the set of allowable snapshots or system states, and a dynamic component, the set of filmstrips or sequences of snapshots. Dia...
Stuart Kent, Ali Hamie, John Howse, Franco Civello...
ECOOP
2009
Springer
16 years 4 months ago
From Public to Private to Absent: Refactoring Java Programs under Constrained Accessibility
Contemporary refactoring tools for JAVA aiding in the restructuring of programs have problems with respecting access modifiers such as public and private: while some tools provide ...
Friedrich Steimann, Andreas Thies