Aart Middeldorp

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Satoshi Okui

> Home > Persons > Aart Middeldorp

Publications

1998
[j11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jsc/MiddeldorpO98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/MiddeldorpO98
Aart Middeldorp, Satoshi Okui:
A Deterministic Lazy Narrowing Calculus. J. Symb. Comput. 25(6): 733-757 (1998)
1996
[j8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/MiddeldorpOI96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MiddeldorpOI96
Aart Middeldorp, Satoshi Okui, Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theor. Comput. Sci. 167(1&2): 95-130 (1996)
1995
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/tapsoft/OkuiMI95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tapsoft/OkuiMI95
Satoshi Okui, Aart Middeldorp, Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). TAPSOFT 1995: 394-408
[c10]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/unif/MiddeldorpOI95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/unif/MiddeldorpOI95
Aart Middeldorp, Satoshi Okui, Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination. UNIF 1995: 43-46

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.