Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories

Autor: Hélène Kirchner, Pierre-Etienne Moreau

Publikováno v: Journal of Functional Programming
Journal of Functional Programming, Cambridge University Press (CUP), 2001, 11 (3), pp.207-251
Journal of Functional Programming, 2001, 11 (3), pp.207-251

Article dans revue scientifique avec comité de lecture.; First-order languages based on rewrite rules share many features with functional languages. But one difference is that matching and rewriting can be made much more expressive and powerful by i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b278fa535c3e71b476063429fb1da1de
https://doi.org/10.1017/s0956796800003907

Propriétés fines des trajectoires du mouvement brownien fractionnaire

Autor: Baraka, Driss

Let X = {X(t); t ∈ RN} be a (N,d) fractional Brownian motion in Rd of index H ∈ (0,1). We study the local time of X for all temporal dimensions N and spatial dimensions d for which local time exist. We obtain two main results : R1. If we denote b

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0067fa7e10d412074dee1f0f548fce2

Kolmogorov complexity and non-determinism

Autor: Jean-Yves Marion, Serge Grigorieff

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, 2002, 271 (1-2), pp.151-180. ⟨10.1016/S0304-3975(01)00038-X⟩
Theoretical Computer Science, Elsevier, 2002, 271 (1-2), pp.151-180. ⟨10.1016/S0304-3975(01)00038-X⟩

We are concerned with Kolmogorov complexity of strings produced by non-deterministic algorithms. For this, we consider five classes of non-deterministic description modes: (i) non-bounded description modes in which the number of outputs depends on pr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a580a05b2d5a4e3f72d9bfc17af7240
https://inria.hal.science/inria-00100709

Analysis of probabilistic programs by abstract interpretation

Autor: Monniaux, David

Publikováno v: Software Engineering [cs.SE]. Université Paris Dauphine-Paris IX, 2001. English

The study of probabilistic programs is of considerable interest for the validation of networking protocols, embedded systems, or simply for compiling optimizations. It is also a difficult matter, due to the undecidability of properties on infinite-st

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::853194a1c7eacb9122f229679a49d3bc
https://tel.archives-ouvertes.fr/tel-00084287/document

The Rewriting Calculus - Part II

Autor: Claude Kirchner, Horatiu Cirstea

Publikováno v: Logic Journal of the IGPL
Logic Journal of the IGPL, 2001, 9 (3), pp.465-498. ⟨10.1093/jigpal/9.3.377⟩
Logic Journal of the IGPL, Oxford University Press (OUP), 2001, 9 (3), pp.465-498. ⟨10.1093/jigpal/9.3.377⟩

Article dans revue scientifique avec comité de lecture.; The rho-calculus integrates in a uniform and simple setting first-order rewriting, lambda-calculus and non-deterministic computations. Its abstraction mechanism is based on the rewrite rule fo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b9d1f38e8746515b758bf830589c3a2
https://inria.hal.science/inria-00100532