“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

Citation Type

Citation Type

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. Expand
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. Expand
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… Expand
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… Expand
A formalisation of the theory of context-free languages in higher order logic
We present a formalisation of the theory of context-free languages using the HOL4 theorem prover. The formalisation of this theory is not only interesting in its own right, but also gives insight… Expand
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… Expand
Correct computation rules for recursive languages
  • P. Downey, R. 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… Expand
The Rest of the World
This chapter discusses different types of metasyntactic languages. The metasemantic and metapragmatic language is based on the first syntax-oriented translator. There are two other types of… Expand