Searching for authors named "Charles Meyssonnier" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

delta-approximable Functions
by Charles Meyssonnier, Paolo Boldi, Sebastiano Vigna — 2001
…In this paper we study several notions of approximability of functions in the framework of the BSS model. Denoting with # # M the function computed by a BSS machine M when its comparisons are against -# rather than 0, we study classes of functions f for which # # M # f in some sense (poi…
Add To MetaCart

A Logic You Can Count On
by Silvano Dal Zilio, Denis Lugiez, Charles Meyssonnier — 2004 — In POPL 2004 – 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
…We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression language for semistructured data. The essence of this result is a surprising connection between formulas of the ambient logic …
Cited by 15 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB