| 2008 |
|---|
| 48 | EE | Emi Mathews,
Axel Poigné:
An Echo State Network based pedestrian counting system using wireless sensor networks.
WISES 2008: 1-14 |
| 2007 |
|---|
| 47 | EE | Mario Boley,
Tamás Horváth,
Axel Poigné,
Stefan Wrobel:
Efficient Closed Pattern Mining in Strongly Accessible Set Systems.
MLG 2007 |
| 46 | EE | 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 |
| 2006 |
|---|
| 45 | EE | Reinhard Budde,
Axel Poigné,
Karl-Heinz Sylla:
synERJY An Object-oriented Synchronous Language.
Electr. Notes Theor. Comput. Sci. 153(4): 99-115 (2006) |
| 2001 |
|---|
| 44 | | Albert Benveniste,
Axel Poigné:
Foreword.
Formal Methods in System Design 19(1): 5-6 (2001) |
| 2000 |
|---|
| 43 | EE | Reinhard Budde,
Axel Poigné:
Complex Reactive Control with Simple Synchronous Models.
LCTES 2000: 19-32 |
| 1999 |
|---|
| 42 | EE | Reinhard Budde,
G. Michele Pinna,
Axel Poigné:
Coordination of Synchronous Programs.
COORDINATION 1999: 103-117 |
| 1998 |
|---|
| 41 | | 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) |
| 1997 |
|---|
| 40 | EE | Axel Poigné,
Leszek Holenderski:
On the Combination of Synchronous Languages.
COMPOS 1997: 490-514 |
| 39 | | Leszek Holenderski,
Axel Poigné:
Synchronous Automata for Synchronous Programming Languages.
FBT 1997: 129-134 |
| 1995 |
|---|
| 38 | | G. Michele Pinna,
Axel Poigné:
Event Automata as a Generic Model of Reactive Systems.
KORSO Book 1995: 74-91 |
| 37 | EE | G. Michele Pinna,
Axel Poigné:
On the Nature of Events: Another Perspective in Concurrency.
Theor. Comput. Sci. 138(2): 425-454 (1995) |
| 1993 |
|---|
| 36 | | G. Michele Pinna,
Axel Poigné:
On the Specification of Elementary Reactive Behaviour.
MFPS 1993: 271-292 |
| 1992 |
|---|
| 35 | | Axel Poigné:
Identity and Existence, and Types in Algebra - A Survey of Sorts.
COMPASS/ADT 1992: 53-78 |
| 34 | | David Murphy,
Axel Poigné:
A Functorial Semantics for Observed Concurrency.
MFCS 1992: 401-411 |
| 33 | | G. Michele Pinna,
Axel Poigné:
On the Nature of Events.
MFCS 1992: 430-441 |
| 1991 |
|---|
| 32 | | David H. Pitt,
Pierre-Louis Curien,
Samson Abramsky,
Andrew M. Pitts,
Axel Poigné,
David E. Rydeheard:
Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings
Springer 1991 |
| 31 | | Axel Poigné:
Once More on Order-Sorted Algebras.
MFCS 1991: 397-405 |
| 1990 |
|---|
| 30 | | Axel Poigné:
Typed Horn Logic.
MFCS 1990: 470-477 |
| 29 | | Axel Poigné:
Parametrization for Order-Sorted Algebraic Specification.
J. Comput. Syst. Sci. 40(2): 229-268 (1990) |
| 28 | | Hagen Huwig,
Axel Poigné:
A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category.
Theor. Comput. Sci. 73(1): 101-112 (1990) |
| 1989 |
|---|
| 27 | | David H. Pitt,
David E. Rydeheard,
Peter Dybjer,
Andrew M. Pitts,
Axel Poigné:
Category Theory and Computer Science, Manchester, UK, September 5-8, 1989, Proceedings
Springer 1989 |
| 26 | | Axel Poigné:
Bisimulation as cointersection.
Bulletin of the EATCS 39: 197-198 (1989) |
| 1988 |
|---|
| 25 | | Axel Poigné:
Towards a Unified Logic for Specification and Programming.
ADT 1988 |
| 24 | | Axel Poigné:
Foundations are Rich Institutions, but Institutions are Poor Foundations.
Categorial Methods in Computer Science 1988: 82-101 |
| 1987 |
|---|
| 23 | | David H. Pitt,
Axel Poigné,
David E. Rydeheard:
Category Theory and Computer Science, Edinburgh, UK, September 7-9, 1987, Proceedings
Springer 1987 |
| 22 | | Axel Poigné:
Partial Algebras, Subsorting, and Dependent Types: Prerequisites of Error Handling in Algebraic Specifications.
ADT 1987: 208-234 |
| 21 | | Axel Poigné:
A remark on variations of power domains.
Bulletin of the EATCS 31: 38-41 (1987) |
| 20 | | 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) |
| 1986 |
|---|
| 19 | | David H. Pitt,
Samson Abramsky,
Axel Poigné,
David E. Rydeheard:
Category Theory and Computer Programming, Tutorial and Workshop, Guildford, UK, September 16-20, 1985 Proceedings
Springer 1986 |
| 18 | | Axel Poigné:
Error Handling as Type Checking.
ADT 1986 |
| 17 | | Axel Poigné:
On Specifications, Theories, and Models with Higher Types
Information and Control 68(1-3): 1-46 (1986) |
| 1985 |
|---|
| 16 | | Axel Poigné:
Category Theory and Logic.
CTCS 1985: 103-142 |
| 15 | | Axel Poigné:
Elements of Categorical Reasoning: Products and Coproducts and some other (Co-) Limits.
CTCS 1985: 16-42 |
| 14 | | Axel Poigné:
A Note on Distributive Laws and Power Domains.
CTCS 1985: 252-265 |
| 13 | | Axel Poigné:
Cartesian Closure - Higher Types in Categories.
CTCS 1985: 58-75 |
| 12 | | Axel Poigné:
Algebra Categorically.
CTCS 1985: 76-102 |
| 11 | | Axel Poigné,
Josef Voss:
On the Implementation of Abstract Data Types by Programming Language Constructs.
TAPSOFT, Vol.1 1985: 388-402 |
| 1984 |
|---|
| 10 | | Axel Poigné:
Error Handling for Parameterized Data Types.
ADT 1984: 224-239 |
| 9 | | Axel Poigné:
Another Look at Parameterization Using Algebras with Subsorts.
MFCS 1984: 471-479 |
| 8 | | Axel Poigné:
Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus.
STACS 1984: 174-185 |
| 1983 |
|---|
| 7 | | Axel Poigné:
Programs over Abstract Data Types.
ADT 1983 |
| 6 | | Axel Poigné:
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.
Theoretical Computer Science 1983: 289-300 |
| 1982 |
|---|
| 5 | | Axel Poigné:
On effective computations of nondeterministic schemes.
Symposium on Programming 1982: 323-336 |
| 1981 |
|---|
| 4 | | Axel Poigné:
Context-Free Languages of Infinite Words As Least Fixpoints.
FCT 1981: 301-310 |
| 3 | | Axel Poigné:
An Order Semantics for Non-Deterministic Recursive Program Schemes.
GI Jahrestagung 1981: 122-129 |
| 2 | | Axel Poigné:
Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic Equations.
ICFPC 1981: 447-459 |
| 1980 |
|---|
| 1 | | Hagen Huwig,
Axel Poigné:
A criterion common to various continuous completions of albegras and X-categories.
CLAAP 1980: 75-82 |
