Sciweavers

7167 search results - page 778 / 1434
» Answer Set Programming
Sort
View
191
Voted
APLAS
2000
ACM
15 years 11 months ago
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
Oukseh Lee, Kwangkeun Yi
AIMSA
2000
Springer
15 years 11 months ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva
CARDIS
2000
Springer
173views Hardware» more  CARDIS 2000»
15 years 11 months ago
Smart Tools for Java Cards
This article describes a Java Card programming environment which to a large extent is generated from formal specifications of the syntax and semantics of Java Card, the JCRE (Jav...
Isabelle Attali, Denis Caromel, Carine Courbis, Lu...
207
Voted
ECOOP
1999
Springer
15 years 11 months ago
Type-Safe Delegation for Run-Time Component Adaptation
Abstract. The aim of component technology is the replacement of large monolithic applications with sets of smaller software components, whose particular functionality and interoper...
Günter Kniesel
IWPC
1999
IEEE
15 years 11 months ago
Understanding COBOL Systems using Inferred Types
In a typical COBOL program, the data division consists of 50% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations ...
Arie van Deursen, Leon Moonen