Axel Poigné

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): 691-700 (2010)

Emi Mathews, Axel Poigné: Evaluation of a "Smart" Pedestrian Counting System Based on Echo State Networks. EURASIP J. Emb. Sys. 2009 (2009)

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

Emi Mathews, Axel Poigné: An Echo State Network based pedestrian counting system using wireless sensor networks. WISES 2008: 1-14

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: 382-389

Reinhard Budde, Axel Poigné, Karl-Heinz Sylla: synERJY An Object-oriented Synchronous Language. Electr. Notes Theor. Comput. Sci. 153(4): 99-115 (2006)

Albert Benveniste, Axel Poigné: Foreword. Formal Methods in System Design 19(1): 5-6 (2001)

Reinhard Budde, Axel Poigné: Complex Reactive Control with Simple Synchronous Models. LCTES 2000: 19-32

Reinhard Budde, G. Michele Pinna, Axel Poigné: Coordination of Synchronous Programs. COORDINATION 1999: 103-117

Axel Poigné, Matthew Morley, Olivier Maffeïs, Leszek Holenderski, Reinhard Budde: The Synchronous Approach to Designing Reactive Systems. Formal Methods in System Design 12(2): 163-187 (1998)

Axel Poigné, Leszek Holenderski: On the Combination of Synchronous Languages. COMPOS 1997: 490-514

Leszek Holenderski, Axel Poigné: Synchronous Automata for Synchronous Programming Languages. FBT 1997: 129-134

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

G. Michele Pinna, Axel Poigné: Event Automata as a Generic Model of Reactive Systems. KORSO Book 1995: 74-91

G. Michele Pinna, Axel Poigné: On the Specification of Elementary Reactive Behaviour. MFPS 1993: 271-292

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

David Murphy, Axel Poigné: A Functorial Semantics for Observed Concurrency. MFCS 1992: 401-411

G. Michele Pinna, Axel Poigné: On the Nature of Events. MFCS 1992: 430-441

Axel Poigné: Once More on Order-Sorted Algebras. MFCS 1991: 397-405

David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné, David E. Rydeheard (Eds.): Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings. Lecture Notes in Computer Science 530, Springer 1991, isbn 3-540-54495-X

Axel Poigné: Parametrization for Order-Sorted Algebraic Specification. J. Comput. Syst. Sci. 40(2): 229-268 (1990)

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

Axel Poigné: Typed Horn Logic. MFCS 1990: 470-477

Axel Poigné: Bisimulation as cointersection. Bulletin of the EATCS 39: 197-198 (1989)

David H. Pitt, David E. Rydeheard, Peter Dybjer, Andrew M. Pitts, Axel Poigné (Eds.): Category Theory and Computer Science, Manchester, UK, September 5-8, 1989, Proceedings. Lecture Notes in Computer Science 389, Springer 1989, isbn 3-540-51662-X

Axel Poigné: Towards a Unified Logic for Specification and Programming. ADT 1988

Axel Poigné: Foundations are Rich Institutions, but Institutions are Poor Foundations. Categorial Methods in Computer Science 1988: 82-101

Axel Poigné: A remark on variations of power domains. Bulletin of the EATCS 31: 38-41 (1987)

Axel Poigné, Josef Voss: On the Implementation of Abstract Data Types by Programming Language Constructs. J. Comput. Syst. Sci. 34(2/3): 340-376 (1987)

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

David H. Pitt, Axel Poigné, David E. Rydeheard (Eds.): Category Theory and Computer Science, Edinburgh, UK, September 7-9, 1987, Proceedings. Lecture Notes in Computer Science 283, Springer 1987, isbn 3-540-18508-9

Axel Poigné: On Specifications, Theories, and Models with Higher Types. Information and Control 68(1-3): 1-46 (1986)

Axel Poigné: Error Handling as Type Checking. ADT 1986

David H. Pitt, Samson Abramsky, Axel Poigné, David E. Rydeheard (Eds.): Category Theory and Computer Programming, Tutorial and Workshop, Guildford, UK, September 16-20, 1985 Proceedings. Lecture Notes in Computer Science 240, Springer 1986, isbn 3-540-17162-2

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

Axel Poigné: Cartesian Closure - Higher Types in Categories. CTCS 1985: 58-75

Axel Poigné: Algebra Categorically. CTCS 1985: 76-102

Axel Poigné: Category Theory and Logic. CTCS 1985: 103-142

Axel Poigné: A Note on Distributive Laws and Power Domains. CTCS 1985: 252-265

Axel Poigné, Josef Voss: On the Implementation of Abstract Data Types by Programming Language Constructs. TAPSOFT, Vol.1 1985: 388-402

Axel Poigné: Error Handling for Parameterized Data Types. ADT 1984: 224-239

Axel Poigné: Another Look at Parameterization Using Algebras with Subsorts. MFCS 1984: 471-479

Axel Poigné: Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus. STACS 1984: 174-185

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: 289-300

Axel Poigné: On effective computations of nondeterministic schemes. Symposium on Programming 1982: 323-336

Axel Poigné: Context-Free Languages of Infinite Words As Least Fixpoints. FCT 1981: 301-310

Axel Poigné: An Order Semantics for Non-Deterministic Recursive Program Schemes. GI Jahrestagung 1981: 122-129

Axel Poigné: Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic Equations. ICFPC 1981: 447-459

Hagen Huwig, Axel Poigné: A criterion common to various continuous completions of albegras and X-categories. CLAAP 1980: 75-82