A programming language for the inductive sets, and applications
www.sciencedirect.com › article › pii
We describe a programming language IND that generalizes alternating Turing machines to arbitrary first-order structures. We show that IND programs (resp.
Oct 22, 2005 · We introduce a programming language IND that generalizes alternating Turing machines to arbitrary first-order structures.
A Programming Language for the Inductive Sets, and Applications. Authors: David Harel. David Harel. View Profile. and Dexter Kozen. Dexter Kozen.
IND provides a simple and highly intuitive computational framework for the theory of inductive definability. For example, our proof of (2) involves showing that ...
Harel, David ; KOZEN, D. / A PROGRAMMING LANGUAGE FOR THE INDUCTIVE SETS, AND APPLICATIONS. In: Lecture Notes in Computer Science. 1982 ; Vol. 140. pp. 313-329.
A Programming Language for the Inductive Sets, and Applications · D. Harel, D. Kozen · Published in Information and Control 1 April 1982 · Computer Science, ...
Apr 1, 1982 · We introduce a programming language IND that generalizes alternating Turing machines to arbitrary first-order structures. We show that IND ...
People also ask
What is the meaning of inductive programming?
What is the most commonly used programming language for programmable logic controllers?
What programming languages are used for neural networks?
What is a programming language which is used for scientific purpose called?
A PROGRAMMING LANGUAGE FOR THE INDUCTIVE SETS, AND APPLICATIONS - The Weizmann Institute of Science - Journal article.
We introduce a programming language IND that general1zes alternat1ng. Turing machines to arb1trary flrst-order structures. We show that IND programs ...
https://dblp.org/rec/conf/icalp/HarelK82 · David Harel, Dexter Kozen: A Programming Language for the Inductive Sets, and Applications. ICALP 1982: 313-329.