Axel Poigné

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