A criterion common to various continuous completions of albegras and X-categories. - Hagen Huwig; Axel Poigné (CLAAP, 1980)

Context-Free Languages of Infinite Words As Least Fixpoints. - Axel Poigné (FCT, 1981)

An Order Semantics for Non-Deterministic Recursive Program Schemes. - Axel Poigné (GI Jahrestagung, 1981)

Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic Equations. - Axel Poigné (ICFPC, 1981)

On effective computations of nondeterministic schemes. - Axel Poigné (Symposium on Programming, 1982)

Programs over Abstract Data Types. - Axel Poigné (ADT, 1983)

On algebras of computation sequences and proofs of equivalence of operational and denotational semantics. - Axel Poigné (Theoretical Computer Science, 1983)

Error Handling for Parameterized Data Types. - Axel Poigné (ADT, 1984)

Another Look at Parameterization Using Algebras with Subsorts. - Axel Poigné (MFCS, 1984)

Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus. - Axel Poigné (STACS, 1984)

Elements of Categorical Reasoning: Products and Coproducts and some other (Co-) Limits. - Axel Poigné (CTCS, 1985)

Cartesian Closure - Higher Types in Categories. - Axel Poigné (CTCS, 1985)

Algebra Categorically. - Axel Poigné (CTCS, 1985)

Category Theory and Logic. - Axel Poigné (CTCS, 1985)

A Note on Distributive Laws and Power Domains. - Axel Poigné (CTCS, 1985)

Error Handling as Type Checking. - Axel Poigné (ADT, 1986)

On Specifications, Theories, and Models with Higher Types - Axel Poigné (Inf. Control., 1986)

Partial Algebras, Subsorting, and Dependent Types: Prerequisites of Error Handling in Algebraic Specifications. - Axel Poigné (ADT, 1987)

A remark on variations of power domains. - Axel Poigné (Bull. EATCS, 1987)

On the Implementation of Abstract Data Types by Programming Language Constructs. - Axel Poigné; Josef Voss (J. Comput. Syst. Sci., 1987)

Towards a Unified Logic for Specification and Programming. - Axel Poigné (ADT, 1988)

Foundations are Rich Institutions, but Institutions are Poor Foundations. - Axel Poigné (Categorial Methods in Computer Science, 1988)

Bisimulation as cointersection. - Axel Poigné (Bull. EATCS, 1989)

Typed Horn Logic. - Axel Poigné (MFCS, 1990)

Parametrization for Order-Sorted Algebraic Specification. - Axel Poigné (J. Comput. Syst. Sci., 1990)

A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category. - Hagen Huwig; Axel Poigné (Theor. Comput. Sci., 1990)

Once More on Order-Sorted Algebras. - Axel Poigné (MFCS, 1991)

Identity and Existence, and Types in Algebra - A Survey of Sorts. - Axel Poigné (COMPASS/ADT, 1992)

A Functorial Semantics for Observed Concurrency. - David Murphy; Axel Poigné (MFCS, 1992)

On the Nature of Events. - G. Michele Pinna; Axel Poigné (MFCS, 1992)

On the Specification of Elementary Reactive Behaviour. - G. Michele Pinna; Axel Poigné (MFPS, 1993)

Event Automata as a Generic Model of Reactive Systems. - G. Michele Pinna; Axel Poigné (KORSO Book, 1995)

On the Nature of Events: Another Perspective in Concurrency. - G. Michele Pinna; Axel Poigné (Theor. Comput. Sci., 1995)

On the Combination of Synchronous Languages. - Axel Poigné; Leszek Holenderski (COMPOS, 1997)

Synchronous Automata for Synchronous Programming Languages. - Leszek Holenderski; Axel Poigné (FBT, 1997)

Synchronie Workbench. - Leszek Holenderski; Axel Poigné (Tool Support for System Specification, Development and Verification, 1998)

The Synchronous Approach to Designing Reactive Systems. - Axel Poigné; Matthew Morley; Olivier Maffeïs; Leszek Holenderski; Reinhard Budde (Formal Methods Syst. Des., 1998)

Coordination of Synchronous Programs. - Reinhard Budde; G. Michele Pinna; Axel Poigné (COORDINATION, 1999)

Complex Reactive Control with Simple Synchronous Models. - Reinhard Budde; Axel Poigné (LCTES, 2000)

Foreword. - Albert Benveniste; Axel Poigné (Formal Methods Syst. Des., 2001)

synERJY An Object-oriented Synchronous Language. - Reinhard Budde; Axel Poigné; Karl-Heinz Sylla (SLAP@ETAPS, 2004)

Efficient Closed Pattern Mining in Strongly Accessible Set Systems. - Mario Boley; Tamás Horváth 001; Axel Poigné; Stefan Wrobel (MLG, 2007)

Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract). - Mario Boley; Tamás Horváth 001; Axel Poigné; Stefan Wrobel (PKDD, 2007)

An Echo State Network based pedestrian counting system using wireless sensor networks. - Emi Mathews; Axel Poigné (WISES, 2008)

Towards a Reference Model for the LifeWatch ICT Infrastructure. - Vera Hernández Ernst; Axel Poigné; Jonathan Giddy; Alex R. Hardisty; Angi Voss; Hans Voss (GI Jahrestagung, 2009)

New Results on Listing Closed Sets of Strongly Accessible Set Systems. - Mario Boley; Tamás Horváth 001; Axel Poigné; Stefan Wrobel (MLG/SRL@ILP, 2009)

Evaluation of a "Smart" Pedestrian Counting System Based on Echo State Networks. - Emi Mathews; Axel Poigné (EURASIP J. Embed. Syst., 2009)

Listing closed sets of strongly accessible set systems with applications to data. - Mario Boley; Tamás Horváth 001; Axel Poigné; Stefan Wrobel (LWA, 2010)

Listing closed sets of strongly accessible set systems with applications to data mining. - Mario Boley; Tamás Horváth 001; Axel Poigné; Stefan Wrobel (Theor. Comput. Sci., 2010)