default search action

combined dblp search
author search
venue search
publication search

ask others

Information and Computation, Volume 93

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

> Home > Journals > Information and Computation

Volume 93, Number 1, 1991

- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/iandc/Parikh91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Parikh91
Rohit Parikh:
Preface. Inf. Comput. 93(1): iii (1991)
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/Wand91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Wand91
Mitchell Wand:
Type Inference for Record Concatenation and Multiple Inheritance. 1-15
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/MisloveMO91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/MisloveMO91
Michael W. Mislove, Lawrence S. Moss, Frank J. Oles:
Non-Well-Founded Sets Modeled as Ideal Fixed Points. 16-54
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/Moggi91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Moggi91
Eugenio Moggi:
Notions of Computation and Monads. 55-92
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/Leivant91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Leivant91
Daniel Leivant:
Finitely Stratified Polymorphism. 93-113
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/Moschovakis91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Moschovakis91
Yiannis N. Moschovakis:
A Model of Concurrency with Fair Merge and Full Recursion. 114-171
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/Breazu-TannenCGS91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Breazu-TannenCGS91
Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov:
Inheritance as Implicit Coercion. 172-221

Volume 93, Number 2, 1991

- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/AielloH91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/AielloH91
William Aiello, Johan Håstad:
Relativized Perfect Zero Knowledge Is Not BPP. 223-240
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/CrescenziP91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/CrescenziP91
Pierluigi Crescenzi, Alessandro Panconesi:
Completeness in Approximation Classes. 241-262
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/PassayT91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/PassayT91
Solomon Passay, Tinko Tinchev:
An Essay in Combinatory Dynamic Logic. 263-332
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/Hoover91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Hoover91
H. James Hoover:
Real Functions, Contraction Mappings and P-Completeness. 333-349

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.