Home Catalogue search

eng

Refine your search:

Search in the Catalogues and Directories






	Sort by
Simple Search

Hits 1 – 8 of 8

1	History of Logo
	Solomon, C; Harvey, B; Kahn, K...
	In: Proceedings of the ACM on Programming Languages, vol 4, iss HOPL (2020)
	BASE
	Show details

2	Peter, the Language that does not Exist. ; Peter, le langage qui n’existe pas.
	Liquori, Luigi. - : HAL CCSD, 2007
	In: https://hal.inria.fr/tel-01148503 ; Computation and Language [cs.CL]. INPL - INP de LORRAINE, 2007 (2007)
	BASE
	Show details

3	The duality of computation
	Herbelin, Hugo; Curien, Pierre-Louis
	In: Fifth ACM SIGPLAN International Conference on Functional Programming : ICFP '00 ; https://hal.inria.fr/inria-00156377 ; Fifth ACM SIGPLAN International Conference on Functional Programming : ICFP '00, Sep 2000, Montréal, Canada. pp.233-243 (2000)
	BASE
	Show details

4	Search and Strategies in OPL
	Pascal Van Hentenryck; Laurent Perron; Jean-François Puget...
	In: http://figaro.comp.nus.edu.sg/talks/searchOPL.pdf (2000)
	BASE
	Show details

5	Handling Floating-Point Exceptions in Numeric Programs
	John R. Hauser
	In: http://cch.loria.fr/documentation/IEEE754/ACM/hauser.pdf (1996)
	BASE
	Show details

6	On the expressive power of multiple heads in CHR
	Cinzia Di Giusto; Maurizio Gabbrielli
	In: http://arxiv.org/pdf/0804.3351v3.pdf (804)
	BASE
	Show details

7	On the expressive power of multiple heads in CHR
	Cinzia Di Giusto; Maurizio Gabbrielli
	In: http://arxiv.org/pdf/0804.3351v2.pdf (804)
	BASE
	Show details

8	A On the expressive power of multiple heads in CHR
	Cinzia Di Giusto; Inria Rhône Alpes
	In: http://sardes.inrialpes.fr/~digiusto/publications/acm10.pdf
	Abstract: Constraint Handling Rules (CHR) is a committed-choice declarative language which has been originally designed for writing constraint solvers and which is nowadays a general purpose language. CHR programs consist of multi-headed guarded rules which allow to rewrite constraints into simpler ones until a solved form is reached. Many empirical evidences suggest that multiple heads augment the expressive power of the language, however no formal result in this direction has been proved, so far. In the first part of this paper we analyze the Turing completeness of CHR with respect to the underlying constraint theory. We prove that if the constraint theory is powerful enough then restricting to single head rules does not affect the Turing completeness of the language. On the other hand, differently from the case of the multi-headed language, the single head CHR language is not Turing powerful when the underlying signature (for the constraint theory) does not contain function symbols. In the second part we prove that, no matter which constraint theory is considered, under some reasonable assumptions it is not possible to encode the CHR language (with multi-headed rules) into a single headed language while preserving the semantics of the programs. We also show that, under some stronger assumptions, considering an increasing number of atoms in the head of a rule augments the expressive power of the language.
	Keyword: Categories and Subject Descriptors; CHR; D.3.2 [Programming Languages; D.3.3 [Programming Languages; expressiveness; F.1.1 [Computation by Abstract Devices; F.1.2 [Computation by Abstract Devices; F.3.3 [Logics and Meanings of Programs; Language Classifications—Constraint and logic languages; Language Constructs and Features—Concurrent programming structures; language embedding; Languages; Models of Computation— Relations between models; Models of Computation—Parallelism and concurrency; multiset rewriting systems; Studies of Program Constructs— Control primitives General Terms; Theory Additional Key Words and Phrases
	URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.8284 http://sardes.inrialpes.fr/~digiusto/publications/acm10.pdf
	BASE
	Hide details

© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern