Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules

doi 10.15760/etd.7071
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Portland State University Library

Related search

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Tiling Optimizations for Stencil Computations Using Rewrite Rules in Lift

Transactions on Architecture and Code Optimization
HardwareInformation SystemsArchitectureSoftware
2020English

Representing Actions in Equational Logic Programming

1994English

Creation of Parametric Rules to Rewrite Algebraic Expressions in Symbolic Regression

Machine Learning and Data Analysis
2017English

Nondeterministic AND-EXOR Minimisation by Using Rewrite Rules and Simulated Annealing

IEE Proceedings - Computers and Digital Techniques
1999English

Representing SimModel in the Web Ontology Language

2014English

Parsing and Translation of Expressions by Genetic Programming

2005English

Representing Biases for Inductive Logic Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Parsing of Natural Language Requirements

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy