- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j18 |      | Jan A. Bergstra, Inge Bethke, Alban Ponse: Cancellation Meadows: A Generic Basis Theorem and Some Applications. Comput. J. 56(1): 3-14 (2013) |
| 2012 | ||
| j17 | | Jan A. Bergstra, Inge Bethke: On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. Theory Comput. Syst. 50(4): 706-720 (2012) |
| 2011 | ||
| j16 | | Inge Bethke, Piet Rodenburg: Typability in Partial Applicative Structures. Journal of Logic, Language and Information 20(2): 161-168 (2011) |
| j15 | | Jan A. Bergstra, Inge Bethke: Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. Theory Comput. Syst. 48(4): 840-864 (2011) |
| j14 | | 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) |
| 2010 | ||
| j13 | | |
| i6 | | Jan A. Bergstra, Inge Bethke: On the contribution of backward jumps to instruction sequence expressiveness. CoRR abs/1005.5662 (2010) |
| 2009 | ||
| i5 | | |
| i4 | | Inge Bethke, Piet Rodenburg, Arjen Sevenster: The structure of finite meadows. CoRR abs/0903.1196 (2009) |
| i3 | | Jan A. Bergstra, Inge Bethke: Straight-line instruction sequence completeness for total calculation on cancellation meadows. CoRR abs/0905.4612 (2009) |
| 2007 | ||
| j12 | | Jan A. Bergstra, Inge Bethke, Alban Ponse: Decision problems for pushdown threads. Acta Inf. 44(2): 75-90 (2007) |
| i2 | | Jan A. Bergstra, Inge Bethke, Mark Burgess: A process algebra based framework for promise theory. CoRR abs/0707.0744 (2007) |
| i1 | | |
| 2005 | ||
| j11 | | Jan A. Bergstra, Inge Bethke: An upper bound for the equational specification of finite state services. Inf. Process. Lett. 94(6): 267-269 (2005) |
| j10 | | Jan A. Bergstra, Inge Bethke: Network algebra in Java. J. Log. Algebr. Program. 62(2): 247-271 (2005) |
| j9 | | Jan A. Bergstra, Inge Bethke: Polarized process algebra with reactive composition. Theor. Comput. Sci. 343(3): 285-304 (2005) |
| 2003 | ||
| c4 | | |
| 2002 | ||
| j8 | | |
| 2000 | ||
| j7 | | Inge Bethke, Jan Willem Klop, Roel C. de Vrijer: Descendants and Origins in Term Rewriting. Inf. Comput. 159(1-2): 59-124 (2000) |
| 1999 | ||
| j6 | | Inge Bethke, Jan Willem Klop, Roel C. de Vrijer: Extending partial combinatory algebras. Mathematical Structures in Computer Science 9(4): 483-505 (1999) |
| 1996 | ||
| j5 | | |
| c3 | | Inge Bethke, Jan Willem Klop, Roel C. de Vrijer: Completing Partial Combinatory Algebras With Unique Head-Normal Forms. LICS 1996: 448-454 |
| 1995 | ||
| j4 | | Jan A. Bergstra, Inge Bethke, Piet Rodenburg: A propositional logic with 4 values: true, false, divergent and meaningless. Journal of Applied Non-Classical Logics 5(2): 199-217 (1995) |
| c2 | | |
| 1994 | ||
| j3 | | Jan A. Bergstra, Inge Bethke, Alban Ponse: Process Algebra with Iteration and Nesting. Comput. J. 37(4): 243-258 (1994) |
| 1993 | ||
| c1 | | |
| 1991 | ||
| j2 | | Inge Bethke: Finite Type Structures within Combinatory Algebras. Ann. Pure Appl. Logic 55(2): 101-123 (1991) |
| j1 | | |
| 1 | Jan A. Bergstra | |
| 2 | Mark Burgess | |
| 3 | Jan Willem Klop | |
| 4 | Alban Ponse | |
| 5 | Pieter Hendrik Rodenburg (Piet Rodenburg) | |
| 6 | Arjen Sevenster | |
| 7 | Roel C. de Vrijer |
Data released under the ODC-BY 1.0 license — See also our legal information page