Programming with generators

Berztiss, Alfs T.

doi:10.1002/spe.4380180109

Search citation statements

Order By: Relevance

Paper Sections

Select...

And/or Tree Visiting Via Generators1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1995

1999

Publication Types

Select...

Article2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A generator is a subprogram with a local persistent memory that supplies the next active element until the block in which it was declared is deactivated [19]. The result is given through a suspended mechanism.…”

Section: And/or Tree Visiting Via Generatorsmentioning

confidence: 99%

Embed finite domain constraint programming into Java and some Web-based applications

Loia

Quaggetto

1999

Softw: Pract. Exper.

View full text Add to dashboard Cite

Although constraint programming has attracted much attention in logic programming, nowadays the importance to integrate constraints with imperative programming is widely acknowledged. In particular, in artificial intelligence domains, the benefits deriving from merging constraint-based programming with object-oriented paradigms seem to be still more attractive because of the lack of 'pure' AI languages in supporting structured representations. This work presents the extension of the Java language towards finite domain constraint programming. This extension has been possible thanks to a high-level approach to low-level resource management: the sleeper mechanism. As practical results, this paper shows how Java programmers can develop meaningful applications in which finite domain constraints have been extensively used, as in the design of visual, interactive, user-interface environments in a client-server architecture.

show abstract

Section: And/or Tree Visiting Via Generatorsmentioning

confidence: 99%