Axel Poigné

Publication Activity (10 Years)

Years Active: 1980-2010
Publications (10 Years): 0

Publications

Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Listing closed sets of strongly accessible set systems with applications to data. LWA (2010)
Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Listing closed sets of strongly accessible set systems with applications to data mining. Theor. Comput. Sci. 411 (3) (2010)
Vera Hernández Ernst, Axel Poigné, Jonathan Giddy, Alex R. Hardisty, Angi Voss, Hans Voss
Towards a Reference Model for the LifeWatch ICT Infrastructure. GI Jahrestagung (2009)
Emi Mathews, Axel Poigné
Evaluation of a "Smart" Pedestrian Counting System Based on Echo State Networks. EURASIP J. Embed. Syst. 2009 (2009)
Emi Mathews, Axel Poigné
An Echo State Network based pedestrian counting system using wireless sensor networks. WISES (2008)
Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Efficient Closed Pattern Mining in Strongly Accessible Set Systems. MLG (2007)
Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract). PKDD (2007)
Reinhard Budde, Axel Poigné, Karl-Heinz Sylla
synERJY An Object-oriented Synchronous Language. Electron. Notes Theor. Comput. Sci. 153 (4) (2006)
Albert Benveniste, Axel Poigné
Foreword. Formal Methods Syst. Des. 19 (1) (2001)
Reinhard Budde, Axel Poigné
Complex Reactive Control with Simple Synchronous Models. LCTES (2000)
Reinhard Budde, G. Michele Pinna, Axel Poigné
Coordination of Synchronous Programs. COORDINATION (1999)
Axel Poigné, Matthew Morley, Olivier Maffeïs, Leszek Holenderski, Reinhard Budde
The Synchronous Approach to Designing Reactive Systems. Formal Methods Syst. Des. 12 (2) (1998)
Leszek Holenderski, Axel Poigné
Synchronie Workbench. Tool Support for System Specification, Development and Verification (1998)
Leszek Holenderski, Axel Poigné
Synchronous Automata for Synchronous Programming Languages. FBT (1997)
Axel Poigné, Leszek Holenderski
On the Combination of Synchronous Languages. COMPOS (1997)
G. Michele Pinna, Axel Poigné
On the Nature of Events: Another Perspective in Concurrency. Theor. Comput. Sci. 138 (2) (1995)
G. Michele Pinna, Axel Poigné
On the Specification of Elementary Reactive Behaviour. MFPS (1993)
David Murphy, Axel Poigné
A Functorial Semantics for Observed Concurrency. MFCS (1992)
G. Michele Pinna, Axel Poigné
On the Nature of Events. MFCS (1992)
Axel Poigné
Identity and Existence, and Types in Algebra - A Survey of Sorts. COMPASS/ADT (1992)
Axel Poigné
Once More on Order-Sorted Algebras. MFCS (1991)
Hagen Huwig, Axel Poigné
A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category. Theor. Comput. Sci. 73 (1) (1990)
Axel Poigné
Parametrization for Order-Sorted Algebraic Specification. J. Comput. Syst. Sci. 40 (2) (1990)
Axel Poigné
Typed Horn Logic. MFCS (1990)
Axel Poigné
Bisimulation as cointersection. Bull. EATCS 39 (1989)
Axel Poigné
Foundations are Rich Institutions, but Institutions are Poor Foundations. Categorial Methods in Computer Science (1988)
Axel Poigné
Towards a Unified Logic for Specification and Programming. ADT (1988)
Axel Poigné
A remark on variations of power domains. Bull. EATCS 31 (1987)
Axel Poigné, Josef Voss
On the Implementation of Abstract Data Types by Programming Language Constructs. J. Comput. Syst. Sci. 34 (2/3) (1987)
Axel Poigné
Partial Algebras, Subsorting, and Dependent Types: Prerequisites of Error Handling in Algebraic Specifications. ADT (1987)
Axel Poigné
Error Handling as Type Checking. ADT (1986)
Axel Poigné
On Specifications, Theories, and Models with Higher Types Inf. Control. 68 (1-3) (1986)
Axel Poigné
Category Theory and Logic. CTCS (1985)
Axel Poigné
Elements of Categorical Reasoning: Products and Coproducts and some other (Co-) Limits. CTCS (1985)
Axel Poigné
Algebra Categorically. CTCS (1985)
Axel Poigné
Cartesian Closure - Higher Types in Categories. CTCS (1985)
Axel Poigné
A Note on Distributive Laws and Power Domains. CTCS (1985)
Axel Poigné, Josef Voss
On the Implementation of Abstract Data Types by Programming Language Constructs. TAPSOFT, Vol.1 (1985)
Axel Poigné
Error Handling for Parameterized Data Types. ADT (1984)
Axel Poigné
Another Look at Parameterization Using Algebras with Subsorts. MFCS (1984)
Axel Poigné
Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus. STACS (1984)
Axel Poigné
Programs over Abstract Data Types. ADT (1983)
Axel Poigné
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics. Theoretical Computer Science (1983)
Axel Poigné
On effective computations of nondeterministic schemes. Symposium on Programming (1982)
Axel Poigné
Context-Free Languages of Infinite Words As Least Fixpoints. FCT (1981)
Axel Poigné
An Order Semantics for Non-Deterministic Recursive Program Schemes. GI Jahrestagung (1981)
Axel Poigné
Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic Equations. ICFPC (1981)
Hagen Huwig, Axel Poigné
A criterion common to various continuous completions of albegras and X-categories. CLAAP (1980)