“Pānini-Backus Form” suggested

@article{Ingerman1967PniniBackusFS,
  title={“Pānini-Backus Form” suggested},
  author={Peter Zilahy Ingerman},
  journal={Commun. ACM},
  year={1967},
  volume={10},
  pages={137}
}
View on ACM
doi.org
8 Citations
Background Citations
2
Methods Citations
1

8 Citations

The sound of a spherical cow*

TLDR
It is argued that the potential of simulation studies is not yet realised as it could be, and the benefits and dangers of making abstractions, or failing to make abstractions are considered.

Pāṇini's Grammar and Modern Computation

TLDR
While Pāṇini's Sanskrit grammar is computationally limited, the metalanguage through which his formalism is defined can be directly used to define any rule-based system by mimicking standard formal language definitions as an extension of the grammatical system proper.

Sanskrit signs and Pān. inian scripts

We discuss ways of understanding the Pān. inian grammatical tradition of Sanskrit in computationally tractable ways. We propose to dissociate the formal expression of the locutor’s communicative…

On Panini and the Generative Capacity of Contextualized Replacement Systems

This paper re-examines the widely held belief that the formalism underlying the rule system propounded by the ancient Indian grammarian, Pān. ini (ca. 450–350 BCE), either anticipates or converges…

A formalisation of the theory of context-free languages in higher order logic

TLDR
A formalisation of the theory of context-free languages using the HOL4 theorem prover, and the verification of SLR parsing, which proves to be an ideal case study of how intuitive textbook proofs can blow up in size and complexity.

Rule Based Programming

This chapter addresses the most important and widely used paradigm of expert systems: rule-based programming. Some practitioners identify rule-based systems with expert systems, because the most…

Correct computation rules for recursive languages

  • P. DowneyR. Sethi
  • Computer Science
    16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
  • 1975
This paper considers simple LISP-like languages for the recursive definition of functions, focusing upon the connections between formal computation rules for calculation and the mathematical…

The Rest of the World