Real number computation with committed choice logic programming languages
From MaRDI portal
Publication:1779564
DOI10.1016/J.JLAP.2004.07.005zbMATH Open1080.68011OpenAlexW2032442081MaRDI QIDQ1779564FDOQ1779564
Authors: Hideki Tsuiki
Publication date: 1 June 2005
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2004.07.005
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Real number computation through Gray code embedding.
- Title not available (Why is that?)
- Compact metric spaces as minimal-limit sets in domains of bottomed sequences
- Title not available (Why is that?)
- Nondeterminism and infinite computations in constraint programming
- Title not available (Why is that?)
- Programming Languages and Systems
Cited In (8)
- SHRAD: A language for sequential real number computation
- Extracting total Amb programs from proofs
- Real number computation through Gray code embedding.
- A programming language for the interval geometric machine
- Lookahead analysis in exact real arithmetic with logical methods
- Logic for Gray-code computation
- Programming Languages and Systems
- Intuitionistic fixed point logic
Uses Software
This page was built for publication: Real number computation with committed choice logic programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779564)