Well-Definedness and Observational Equivalence for Inductive–coinductive Programs

Journal of Logic and Computation - United Kingdom
doi 10.1093/logcom/exv091
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Inductive, Coinductive, and Pointed Types

ACM SIGPLAN Notices
1996English

Bootstrapping Inductive and Coinductive Types in HasCASL

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2008English

The Observational-Inductive Framework for Science

AIP Conference Proceedings
AstronomyPhysics
2006English

Inductive Equivalence in Clausal Logic and Nonmonotonic Logic Programming

Machine Learning
Artificial IntelligenceSoftware
2010English

Coinductive Interpreters for Process Calculi

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Coinductive Algorithms for Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

On the Equivalence of Recursive and Nonrecursive Datalog Programs

1992English

Training Programs for Managing Well-Being in Companies

Naše gospodarstvo/Our economy
2015English

Reverse Mathematics and the Equivalence of Definitions for Well and Better Quasi-Orders

Journal of Symbolic Logic
PhilosophyLogic
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy