USING LEAST FIXED POINTS TO CHARACTERIZE FORMAL COMPUTATIONS OF NON-DETERMINISTIC EQUATIONSPOIGNE A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 107; PP. 447-459; BIBL. 18 REF.Conference Paper

ON EFFECTIVE COMPUTATIONS OF NON-DETERMINISTIC SCHEMESPOIGNE A.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 313-336; BIBL. 16 REF.Conference Paper

CONTEXT-FREE LANGUAGES OF FINITE WORDS AS LEAST FIXPOINTSPOIGNE A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 301-320; BIBL. 7 REF.Conference Paper

Parametrization for order-sorted algebraic specificationPOIGNE, A.Journal of computer and system sciences (Print). 1990, Vol 40, Num 2, pp 229-268, issn 0022-0000Article

On specifications, theories, and models with higher typesPOIGNE, A.Information and control. 1986, Vol 68, Num 1-3, pp 1-46, issn 0019-9958Article

A note on inconsistencies caused by fixpoints in a cartesian closed categoryHUWIG, H; POIGNE, A.Theoretical computer science. 1990, Vol 73, Num 1, pp 101-112, issn 0304-3975, 12 p.Article

Proceedings/Category theory and computer science, conference, Edinburgh, U.K., September 7-9, 1987PITT, D. H; POIGNE, A; RYDEHEARD, D. E et al.Lecture notes in computer science. 1987, Vol 283, issn 0302-9743, V-300 pConference Proceedings

On the combination of synchronous languagesPOIGNE, A; HOLENDERSKI, L.Lecture notes in computer science. 1998, pp 490-514, issn 0302-9743, isbn 3-540-65493-3Conference Paper

Coordination of synchronous programsBUDDE, R; PINNA, G. M; POIGNE, A et al.Lecture notes in computer science. 1999, pp 103-117, issn 0302-9743, isbn 3-540-65836-XConference Paper

On the nature of events : another perspective in concurrencyPINNA, G. M; POIGNE, A.Theoretical computer science. 1995, Vol 138, Num 2, pp 425-454, issn 0304-3975Conference Paper