default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlban Ponse
Person information
- affiliation: University of Amsterdam, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i20]Alban Ponse, Daan J. C. Staudt:
Fully Evaluated Left-Sequential Logics. CoRR abs/2403.14576 (2024)- 2023
- [i19]Jan A. Bergstra, Alban Ponse:
Conditional logic as a short-circuit logic. CoRR abs/2304.14821 (2023) - 2022
- [i18]Dalia Papuc, Alban Ponse:
Non-commutative propositional logic with short-circuited biconditional and NAND. CoRR abs/2203.09321 (2022) - 2021
- [j33]Jan A. Bergstra
, Alban Ponse, Daan J. C. Staudt:
Non-commutative propositional logic with short-circuit evaluation. J. Appl. Non Class. Logics 31(3-4): 234-278 (2021) - [j32]Jan A. Bergstra, Alban Ponse:
Datatype defining rewrite systems for naturals and integers. Log. Methods Comput. Sci. 17(1) (2021) - 2020
- [j31]Jan A. Bergstra, Alban Ponse:
Arithmetical datatypes with true fractions. Acta Informatica 57(3-5): 385-402 (2020)
2010 – 2019
- 2018
- [j30]Alban Ponse, Daan J. C. Staudt:
An independent axiomatisation for free short-circuit logic. J. Appl. Non Class. Logics 28(1): 35-71 (2018) - [i17]Jan A. Bergstra, Alban Ponse, Daan J. C. Staudt:
Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant. CoRR abs/1810.02142 (2018) - 2017
- [i16]Alban Ponse, Daan J. C. Staudt:
An independent axiomatization for free short-circuit logic. CoRR abs/1707.05718 (2017) - 2016
- [c12]Jan A. Bergstra, Alban Ponse:
Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract). WADT 2016: 73-87 - [i15]Jan A. Bergstra, Alban Ponse:
Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view. CoRR abs/1608.06212 (2016) - 2015
- [j29]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Equations for formally real meadows. J. Appl. Log. 13(2): 1-23 (2015) - [c11]Jan A. Bergstra, Alban Ponse:
Evaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence. Correct System Design 2015: 44-61 - [c10]Jan A. Bergstra, Alban Ponse:
Division by Zero in Common Meadows. Software, Services, and Systems 2015: 46-61 - [i14]Jan A. Bergstra, Alban Ponse:
Evaluation trees for proposition algebra. CoRR abs/1504.08321 (2015) - 2014
- [i13]Jan A. Bergstra, Alban Ponse:
Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals. CoRR abs/1406.3280 (2014) - 2013
- [j28]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Cancellation Meadows: A Generic Basis Theorem and Some Applications. Comput. J. 56(1): 3-14 (2013) - [i12]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Equations for formally real meadows. CoRR abs/1310.5011 (2013) - 2011
- [j27]Inge Bethke, Alban Ponse, Piet Rodenburg:
Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday. Theor. Comput. Sci. 412(28): 3033-3034 (2011) - [j26]Jan A. Bergstra, Alban Ponse:
Proposition algebra. ACM Trans. Comput. Log. 12(3): 21:1-21:36 (2011) - [c9]Jan A. Bergstra, Alban Ponse:
Proposition Algebra and Short-Circuit Logic. FSEN 2011: 15-31 - 2010
- [i11]Jan A. Bergstra, Alban Ponse:
Short-circuit logic. CoRR abs/1010.3674 (2010) - [i10]Jan A. Bergstra, Alban Ponse:
On Hoare-McCarthy algebras. CoRR abs/1012.5059 (2010)
2000 – 2009
- 2009
- [j25]Jan A. Bergstra, Alban Ponse:
An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. Sci. Ann. Comput. Sci. 19: 57-92 (2009) - [i9]Jan A. Bergstra, Alban Ponse:
An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. CoRR abs/0903.1352 (2009) - [i8]Jan A. Bergstra, Alban Ponse:
A progression ring for interfaces of instruction sequences, threads, and services. CoRR abs/0909.2839 (2009) - 2008
- [j24]Jan A. Bergstra, Alban Ponse, Mark van der Zwaag:
Tuplix Calculus. Sci. Ann. Comput. Sci. 18: 35-61 (2008) - [j23]Alban Ponse, Mark van der Zwaag:
Risk Assessment for One-Counter Threads. Theory Comput. Syst. 43(3-4): 563-582 (2008) - [i7]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Cancellation Meadows: a Generic Basis Theorem and Some Applications. CoRR abs/0803.3969 (2008) - [i6]Jan A. Bergstra, Alban Ponse:
Differential Meadows. CoRR abs/0804.3336 (2008) - [i5]Jan A. Bergstra, Alban Ponse:
Proposition Algebra with Projective Limits. CoRR abs/0807.3648 (2008) - [i4]Jan A. Bergstra, Alban Ponse:
An Instruction Sequence Semigroup with Repeaters. CoRR abs/0810.1151 (2008) - 2007
- [j22]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Decision problems for pushdown threads. Acta Informatica 44(2): 75-90 (2007) - [j21]Jan A. Bergstra, Alban Ponse:
Execution architectures for program algebra. J. Appl. Log. 5(1): 170-192 (2007) - [j20]Alban Ponse, Mark van der Zwaag:
A generalization of ACP using Belnap's logic. J. Log. Algebraic Methods Program. 70(2): 222-235 (2007) - [j19]Alban Ponse, Mark van der Zwaag:
Belnap's logic and conditional composition. Theor. Comput. Sci. 388(1-3): 319-336 (2007) - [i3]Jan A. Bergstra, Alban Ponse:
Projection semantics for rigid loops. CoRR abs/0707.1059 (2007) - [i2]Jan A. Bergstra, Alban Ponse:
Interface groups and financial transfer architectures. CoRR abs/0707.1639 (2007) - [i1]Jan A. Bergstra, Alban Ponse, Mark van der Zwaag:
Tuplix Calculus. CoRR abs/0712.3423 (2007) - 2006
- [c8]Alban Ponse, Mark van der Zwaag:
An Introduction to Program and Thread Algebra. CiE 2006: 445-458 - 2005
- [c7]Jan A. Bergstra, Alban Ponse:
A Bypass of Cohen's Impossibility Result. EGC 2005: 1097-1106 - [c6]Alban Ponse, Mark van der Zwaag:
A Generalization of ACP Using Belnap's Logic. APC 25 2005: 287-293 - 2003
- [j18]Jan A. Bergstra, Alban Ponse, Mark van der Zwaag:
Branching time and orthogonal bisimulation equivalence. Theor. Comput. Sci. 309(1-3): 313-355 (2003) - 2002
- [j17]Alban Ponse:
Program algebra with unit instruction operators. J. Log. Algebraic Methods Program. 51(2): 157-174 (2002) - [j16]Jan A. Bergstra, Alban Ponse:
Combining programs and state machines. J. Log. Algebraic Methods Program. 51(2): 175-192 (2002) - 2001
- [j15]Jan A. Bergstra, Alban Ponse:
Process algebra and conditional composition. Inf. Process. Lett. 80(1): 41-49 (2001) - [j14]Alban Ponse, Yaroslav S. Usenko:
Equivalence of recursive specifications in process algebra. Inf. Process. Lett. 80(1): 59-65 (2001) - [j13]Jan A. Bergstra, Alban Ponse:
Register-machine based processes. J. ACM 48(6): 1207-1241 (2001) - [j12]Jan Friso Groote, Alban Ponse, Yaroslav S. Usenko:
Linearization in parallel pCRL. J. Log. Algebraic Methods Program. 48(1-2): 39-70 (2001) - [j11]Jan A. Bergstra, Alban Ponse:
Non-regular iterators in process algebra. Theor. Comput. Sci. 269(1-2): 203-229 (2001) - [p1]Jan A. Bergstra, Wan J. Fokkink, Alban Ponse:
Process Algebra with Recursive Operations. Handbook of Process Algebra 2001: 333-389 - [e1]Jan A. Bergstra, Alban Ponse, Scott A. Smolka:
Handbook of Process Algebra. North-Holland / Elsevier 2001, ISBN 978-0-444-82830-9 [contents] - 2000
- [j10]Jan A. Bergstra, Alban Ponse:
Process Algebra with Four-Valued Logic. J. Appl. Non Class. Logics 10(1): 27-53 (2000)
1990 – 1999
- 1998
- [j9]Jan A. Bergstra, Alban Ponse:
Kleene's Three-Valued Logic and Process Algebra. Inf. Process. Lett. 67(2): 95-103 (1998) - [j8]Jan A. Bergstra, Alban Ponse:
Bochvar-McCarthy Logic and Process Algebra. Notre Dame J. Formal Log. 39(4): 464-484 (1998) - [c5]Jan A. Bergstra, Alban Ponse:
Grid Protocol Specifications. Prospects for Hardware Foundations 1998: 278-308 - 1997
- [j7]Jan A. Bergstra, Joris A. Hillebrand, Alban Ponse:
Grid Protocols Based on Synchronous Communication. Sci. Comput. Program. 29(1-2): 199-233 (1997) - [j6]Alban Ponse, Chris Verhoef, Bas van Vlijmen:
Algebra of Communicating Processes - Preface to the Special Issue. Theor. Comput. Sci. 177(2): 285-286 (1997) - [j5]Marc Bezem, Alban Ponse:
Two Finite Specifications of a Queue. Theor. Comput. Sci. 177(2): 487-507 (1997) - 1996
- [j4]Alban Ponse:
Computable Processes and Bisimulation Equivalence. Formal Aspects Comput. 8(6): 648-678 (1996) - 1994
- [j3]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Process Algebra with Iteration and Nesting. Comput. J. 37(4): 243-258 (1994) - [j2]Jan Friso Groote, Alban Ponse:
Process Algebra with Guards: Combining Hoare Logic with Process Algebra. Formal Aspects Comput. 6(2): 115-164 (1994) - 1993
- [c4]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Process Algebra with Combinators. CSL 1993: 36-65 - [c3]Jan A. Bergstra, Alban Ponse, Jos van Wamel:
Process Algebra with Backtracking. REX School/Symposium 1993: 46-91 - [c2]Jan Friso Groote, Alban Ponse:
Proof Theory for µCRL: A Language for Processes with Data. Semantics of Specification Languages 1993: 232-251 - 1991
- [j1]Alban Ponse:
Process Expressions and Hoare's Logic: Showing an Irreconcilability of Context-Free Recursion with Scott's Induction Rule. Inf. Comput. 95(2): 192-217 (1991) - [c1]Jan Friso Groote, Alban Ponse:
Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract). CONCUR 1991: 235-249
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-24 23:00 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:
