Raymond Turner

Orcid: 0000-0001-6014-4215

According to our database1, Raymond Turner authored at least 36 papers between 1975 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Computational Abstraction.
Entropy, 2021

2019
Correctness, Explanation and Intention.
Proceedings of the Computing with Foresight and Industry, 2019

2018
Computational Artifacts - Towards a Philosophy of Computer Science
Springer, ISBN: 978-3-662-55564-4, 2018

2011
Specification.
Minds Mach., 2011

2009
Computable Models.
Springer, ISBN: 978-1-84882-052-4, 2009

2008
Computable Models.
J. Log. Comput., 2008

The Philosophy of Computer Science.
J. Appl. Log., 2008

2007
The Philosophy of Computer Science: Introduction to the Special Issue.
Minds Mach., 2007

Understanding Programming Languages.
Minds Mach., 2007

Problems in the ontology of computer programs.
Appl. Ontology, 2007

2006
Computability in Specification.
J. Log. Comput., 2006

2005
The Foundations of Specification.
J. Log. Comput., 2005

Semantics and Stratification.
J. Log. Comput., 2005

2001
Type inference for set theory.
Theor. Comput. Sci., 2001

2000
The YPA - An Assistant for Classified Directory Enquiries.
Proceedings of the Intelligent Systems and Soft Computing: Prospects, 2000

Extracting Semistructured Data - Lessons Learnt.
Proceedings of the Natural Language Processing, 2000

1999
Sets, Types and Type-checking.
J. Log. Comput., 1999

Natural language access to Yellow Pages.
Proceedings of the Third International Conference on Knowledge-Based Intelligent Information Engineering Systems, 1999

1998
Constructive Z.
J. Log. Comput., 1998

1997
Reading Between the Lines in Constructive Type Theory.
J. Log. Comput., 1997

Types.
Proceedings of the Handbook of Logic and Language., 1997

1996
Weak Theories of Operations and Types.
J. Log. Comput., 1996

1993
Lazy Theories of Operations and Types.
J. Log. Comput., 1993

1991
Logical foundations of nonmonotonic reasoning.
Artif. Intell. Rev., 1991

Helpful Answers To Modal And Hypothetical Questions.
Proceedings of the EACL 1991, 1991

A Formal Approach to Translating English into SQL.
Proceedings of the Aspects of Databases, 1991

1990
Logics of Truth.
Notre Dame J. Formal Log., 1990

1988
A Constructive Set Theory for Program Development.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1985
Three theories of nominalized predicates.
Stud Logica, 1985

Nominalization and Scott's domains. II.
Notre Dame J. Formal Log., 1985

An Introduction to the Formal Specification of Relational Query Languages.
Comput. J., 1985

1984
Logics for artificial intelligence.
Ellis Horwood series in artificial intelligence, Ellis Horwood, ISBN: 978-0-85312-713-0, 1984

1982
Completion Semantics, Interpreter Generation.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

1981
Counterfactuals without possible worlds.
J. Philos. Log., 1981

1979
Compiler generation and denotational semantics.
Proceedings of the Fundamentals of Computation Theory, 1979

1975
An Algebraic Theory of Formal Languages.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975


  Loading...