Constructive data refinement in typed lambda calculus
F Honsell, J Longley, D Sannella, A Tarlecki - … 2000 Held as Part of the …, 2000 - Springer
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms
of pre-logical relations [HS99] rather than logical relations, and incorporating a constructive …
of pre-logical relations [HS99] rather than logical relations, and incorporating a constructive …
On recognizable stable trace languages
JF Husson, R Morin - … Conference on Foundations of Software Science …, 2000 - Springer
We relate several models of concurrency introduced in the literature in order to extend
classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold's …
classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold's …
Hierarchy of asynchronous automata
R Morin - Electronic Notes in Theoretical Computer Science, 2000 - Elsevier
We study a natural notion of communication structure associated with asynchronous
automata: we characterize which transition systems are isomorphic to an asynchronous …
automata: we characterize which transition systems are isomorphic to an asynchronous …