Jan Willem Klop - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 50 from 50

2008

Proving Infinitary NormalizationJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer. TYPES 2009: 64-82 [doi]

Lambda calculus with patternsJan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer. TCS, 398(1-3):16-31, 2008. [doi]

2007

Productivity of Stream DefinitionsJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop. fct 2007: 274-287 [doi]

2006

Some Remarks on Definability of Process GraphsClemens Grabmayer, Jan Willem Klop, Bas Luttik. concur 2006: 16-36 [doi]

2005

Vicious Circles in Orthogonal Term Rewriting SystemsJeroen Ketema, Jan Willem Klop, Vincent van Oostrom. ENTCS, 124(2):65-77, 2005. [doi]

2000

A geometric proof of confluence by decreasing diagramsJan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer. logcom, 10(3):437-460, 2000.

1997

Lambda Calculus with Explicit RecursionZena M. Ariola, Jan Willem Klop. iandc, 139(2):154-233, 1997.

Infinitary Lambda CalculusRichard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries. TCS, 175(1):93-125, 1997. [doi]

1996

Completing Partial Combinatory Algebras With Unique Head-Normal FormsInge Bethke, Jan Willem Klop, Roel C. de Vrijer. lics 1996: 448-454

1995

Term Graph RewritingJan Willem Klop. hoa 1996: 1-16

Termination for Direct Sums of Left-Linear Complete Term Rewriting SystemsYoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt. JACM, 42(6):1275-1304, 1995. [doi]

1994

Cyclic Lambda Graph RewritingZena M. Ariola, Jan Willem Klop. lics 1994: 416-425

Syntactic Definitions of Undefined: On Defining the UndefinedZena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries. tacs 1994: 543-554

On the Adequacy of Graph Rewriting for Simulating Term RewritingRichard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries. TOPLAS, 16(3):493-523, 1994. [doi]

1993

Decidability of Bisimulation Equivalence for Processes Generating Context-Free LanguagesJos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop. JACM, 40(3):653-682, 1993. [doi]

More Problems in RewritingNachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop. RTA 1993: 468-487

Combinatory Reduction Systems: Introduction and SurveyJan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk. TCS, 121(1&2):279-308, 1993.

1991

An Analysis of Loop Checking Mechanisms for Logic ProgramsRoland N. Bol, Krzysztof R. Apt, Jan Willem Klop. TCS, 86(1):35-79, 1991.

Open Problems in RewritingNachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop. RTA 1991: 445-456

Sequentiality in Orthogonal Term Rewriting SystemsJan Willem Klop, Aart Middeldorp. JSC, 12(2):161-196, 1991.

1990

Extended Term Rewriting SystemsJan Willem Klop, Roel C. de Vrijer. ctrs 1991: 26-50

Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and BeyondJan Willem Klop. icalp 1990: 350-369

1989

On the Safe Termination of PROLOG ProgramsKrzysztof R. Apt, Roland N. Bol, Jan Willem Klop. ICLP 1989: 353-368

Term-Rewriting Systems with Rule PrioritiesJos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland. TCS, 67(2&3):283-301, 1989.

Unique Normal Forms for Lambda Calculus with Surjective PairingJan Willem Klop, Roel C. de Vrijer. iandc, 80(2):97-113, February 1989.

1988

Readies and Failures in the Algebra of Communicating ProcessesJan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog. SICOMP, 17(6):1134-1177, 1988.

Process theory based on bisimulation semanticsJan A. Bergstra, Jan Willem Klop. rex 1989: 50-122

1987

1986

Conditional Rewrite Rules: Confluence and TerminationJan A. Bergstra, Jan Willem Klop. jcss, 32(3):323-362, 1986.

1985

Algebra of Communicating Processes with AbstractionJan A. Bergstra, Jan Willem Klop. TCS, 37:77-121, 1985.

Verification of an alternating bit protocol by means of process algebraJan A. Bergstra, Jan Willem Klop. aii 1986: 9-23

1984

1983

Initial Algebra Specifications for Parametrized Data TypesJan A. Bergstra, Jan Willem Klop. eik, 19(1/2):17-31, 1983.

Algebraic Tools for System ConstructionJan A. Bergstra, Jan Willem Klop, J. V. Tucker. lop 1984: 34-44

Linear Time and Branching Time Semantics for Recursion with MergeJ. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer. icalp 1983: 39-51

1982

Strong Normalization and Perpetual Reductions in the Lambda CalculusJan A. Bergstra, Jan Willem Klop. eik, 18(7/8):403-417, 1982.

A formalized proof system for total correctness of while programsJan A. Bergstra, Jan Willem Klop. programm 1982: 26-36

Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target AlgebrasJan A. Bergstra, Jan Willem Klop. icalp 1982: 23-34

1981

Correctness of Programs with Function ProceduresJ. W. de Bakker, Jan Willem Klop, John-Jules Ch. Meyer. lop 1982: 94-112

1980

Invertible Terms in the Lambda CalculusJan A. Bergstra, Jan Willem Klop. TCS, 11:19-37, 1980.

1979

Church-Rosser Strategies in the Lambda CalculusJan A. Bergstra, Jan Willem Klop. TCS, 9:27-38, 1979.

1978

Degrees of Sensible Lambda TheoriesHenk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken. JSYML, 43(1):45-55, 1978.

Sign in or sign up to see more results.

runs on WebDSL