default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAxel Poigné
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j11]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)- [c37]Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel:
Listing closed sets of strongly accessible set systems with applications to data. LWA 2010: 33
2000 – 2009
- 2009
- [j10]Emi Mathews, Axel Poigné:
Evaluation of a "Smart" Pedestrian Counting System Based on Echo State Networks. EURASIP J. Embed. Syst. 2009 (2009) - [c36]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: 654-668 - 2008
- [c35]Emi Mathews, Axel Poigné:
An Echo State Network based pedestrian counting system using wireless sensor networks. WISES 2008: 1-14 - 2007
- [c34]Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel:
Efficient Closed Pattern Mining in Strongly Accessible Set Systems. MLG 2007 - [c33]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 - 2004
- [c32]Reinhard Budde, Axel Poigné, Karl-Heinz Sylla:
synERJY An Object-oriented Synchronous Language. SLAP@ETAPS 2004: 99-115 - 2001
- [j9]Albert Benveniste, Axel Poigné:
Foreword. Formal Methods Syst. Des. 19(1): 5-6 (2001) - 2000
- [c31]Reinhard Budde, Axel Poigné:
Complex Reactive Control with Simple Synchronous Models. LCTES 2000: 19-32
1990 – 1999
- 1999
- [c30]Reinhard Budde, G. Michele Pinna, Axel Poigné:
Coordination of Synchronous Programs. COORDINATION 1999: 103-117 - 1998
- [j8]Axel Poigné, Matthew Morley, Olivier Maffeïs, Leszek Holenderski, Reinhard Budde:
The Synchronous Approach to Designing Reactive Systems. Formal Methods Syst. Des. 12(2): 163-187 (1998) - [c29]Leszek Holenderski, Axel Poigné:
Synchronie Workbench. Tool Support for System Specification, Development and Verification 1998: 123-135 - 1997
- [c28]Axel Poigné, Leszek Holenderski:
On the Combination of Synchronous Languages. COMPOS 1997: 490-514 - [c27]Leszek Holenderski, Axel Poigné:
Synchronous Automata for Synchronous Programming Languages. FBT 1997: 129-134 - 1995
- [j7]G. Michele Pinna, Axel Poigné:
On the Nature of Events: Another Perspective in Concurrency. Theor. Comput. Sci. 138(2): 425-454 (1995) - [p1]G. Michele Pinna, Axel Poigné:
Event Automata as a Generic Model of Reactive Systems. KORSO Book 1995: 74-91 - 1993
- [c26]G. Michele Pinna, Axel Poigné:
On the Specification of Elementary Reactive Behaviour. MFPS 1993: 271-292 - 1992
- [c25]Axel Poigné:
Identity and Existence, and Types in Algebra - A Survey of Sorts. COMPASS/ADT 1992: 53-78 - [c24]David Murphy, Axel Poigné:
A Functorial Semantics for Observed Concurrency. MFCS 1992: 401-411 - [c23]G. Michele Pinna, Axel Poigné:
On the Nature of Events. MFCS 1992: 430-441 - 1991
- [c22]Axel Poigné:
Once More on Order-Sorted Algebras. MFCS 1991: 397-405 - [e4]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. Lecture Notes in Computer Science 530, Springer 1991, ISBN 3-540-54495-X [contents] - 1990
- [j6]Axel Poigné:
Parametrization for Order-Sorted Algebraic Specification. J. Comput. Syst. Sci. 40(2): 229-268 (1990) - [j5]Hagen Huwig, Axel Poigné:
A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category. Theor. Comput. Sci. 73(1): 101-112 (1990) - [c21]Axel Poigné:
Typed Horn Logic. MFCS 1990: 470-477
1980 – 1989
- 1989
- [j4]Axel Poigné:
Bisimulation as cointersection. Bull. EATCS 39: 197-198 (1989) - [e3]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. Lecture Notes in Computer Science 389, Springer 1989, ISBN 3-540-51662-X [contents] - 1988
- [c20]Axel Poigné:
Towards a Unified Logic for Specification and Programming. ADT 1988 - [c19]Axel Poigné:
Foundations are Rich Institutions, but Institutions are Poor Foundations. Categorial Methods in Computer Science 1988: 82-101 - 1987
- [j3]Axel Poigné:
A remark on variations of power domains. Bull. EATCS 31: 38-41 (1987) - [j2]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) - [c18]Axel Poigné:
Partial Algebras, Subsorting, and Dependent Types: Prerequisites of Error Handling in Algebraic Specifications. ADT 1987: 208-234 - [e2]David H. Pitt, Axel Poigné, David E. Rydeheard:
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 [contents] - 1986
- [j1]Axel Poigné:
On Specifications, Theories, and Models with Higher Types. Inf. Control. 68(1-3): 1-46 (1986) - [c17]Axel Poigné:
Error Handling as Type Checking. ADT 1986 - [e1]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. Lecture Notes in Computer Science 240, Springer 1986, ISBN 3-540-17162-2 [contents] - 1985
- [c16]Axel Poigné:
Elements of Categorical Reasoning: Products and Coproducts and some other (Co-) Limits. CTCS 1985: 16-42 - [c15]Axel Poigné:
Cartesian Closure - Higher Types in Categories. CTCS 1985: 58-75 - [c14]Axel Poigné:
Algebra Categorically. CTCS 1985: 76-102 - [c13]Axel Poigné:
Category Theory and Logic. CTCS 1985: 103-142 - [c12]Axel Poigné:
A Note on Distributive Laws and Power Domains. CTCS 1985: 252-265 - [c11]Axel Poigné, Josef Voss:
On the Implementation of Abstract Data Types by Programming Language Constructs. TAPSOFT, Vol.1 1985: 388-402 - 1984
- [c10]Axel Poigné:
Error Handling for Parameterized Data Types. ADT 1984: 224-239 - [c9]Axel Poigné:
Another Look at Parameterization Using Algebras with Subsorts. MFCS 1984: 471-479 - [c8]Axel Poigné:
Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus. STACS 1984: 174-185 - 1983
- [c7]Axel Poigné:
Programs over Abstract Data Types. ADT 1983 - [c6]Axel Poigné:
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics. Theoretical Computer Science 1983: 289-300 - 1982
- [c5]Axel Poigné:
On effective computations of nondeterministic schemes. Symposium on Programming 1982: 323-336 - 1981
- [c4]Axel Poigné:
Context-Free Languages of Infinite Words As Least Fixpoints. FCT 1981: 301-310 - [c3]Axel Poigné:
An Order Semantics for Non-Deterministic Recursive Program Schemes. GI Jahrestagung 1981: 122-129 - [c2]Axel Poigné:
Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic Equations. ICFPC 1981: 447-459 - 1980
- [c1]Hagen Huwig, Axel Poigné:
A criterion common to various continuous completions of albegras and X-categories. CLAAP 1980: 75-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
