|
|
On Founding the Theory of Algorithms
– Yiannis Moschovakis My, Yiannis N. Moschovakis, Let L
- 1998
|
|
8
|
On Founding the Theory of Algorithms
– Yiannis N. Moschovakis, Let L
- 1998
|
|
10
|
Notions of computability at higher types I
– John Longley
- 2005
|
|
3
|
The Logic Of Functional Recursion
– Yiannis N. Moschovakis
- 1997
|
|
16
|
Higher Order Logic
– Daniel Leivant
- 1994
|
|
|
Logic Colloquium '90
– Asl Meeting Helsinki, Yiannis N. Moschovakis
|
|
18
|
Sense and Denotation as Algorithm and Value
– Yiannis N. Moschovakis
- 1990
|
|
|
An Intensional Investigation of Parallelism
– Denis Dancanet
- 1994
|
|
19
|
Computational Foundations of Basic Recursive Function Theory
– Robert L. Constable, Scott Fraser Smith
- 1988
|
|
7
|
1996], Computation on abstract data types. The extensional approach, with an application to streams
– Solomon Feferman, C. Kleene
|
|
1
|
Implicit Programming and the Logic of Constructible Duality
– Cflcopyright Anna L. Patterson, L. Patterson
|
|
23
|
Games and full abstraction for nondeterministic languages
– Russell S. Harmer
- 1999
|
|
6
|
Interpreter Prototypes From Formal Language Definitions
– Gregory John Michaelson
- 1993
|
|
|
Recursion Theory
– Helmut Schwichtenberg
- 2007
|
|
|
Moschovakis' Notion Of Meaning As Applied To Linguistics
– Michiel Van, Michiel van Lambalgen, Fritz Hamm
- 2002
|
|
5
|
The Unfolding of Non-Finitist Arithmetic
– Solomon Feferman, Thomas Strahm
- 2000
|
|
1
|
Arithmetic complexity
– Yiannis N. Moschovakis
- 2007
|
|
1
|
Game Representations of Complexity Classes
– Gregory McColm
- 2001
|
|
21
|
Correspondence between Operational and Denotational Semantics
– C. -h. L. Ong
- 1995
|
