We develop some Higher-Order Abstract Syntax (HOAS) concepts and proof principles as a collection of definitions and propositions on top of the original syntax with bindings. Our approach brings together hassle-free (i.e., bindingand substitution-free) manipulation of the objects on the one hand, and inductive reasoning about the same objects on the other. We present our approach by providing a...

We formulate principles of induction and recursion for a variant of lambda calculus in its original syntax (i.e., with only one sort of names) where α-conversion is based upon name swapping as in nominal abstract syntax. The principles allow to work modulo α-conversion and implement the Barendregt variable convention. We derive them all from the simple structural induction principle on concrete...

Although space syntax has been successfully applied to many urban GIS studies, there is still a need to develop robust algorithms that support the automated derivation of graph representations. These graph structures are needed to apply the computational principles of space syntax and derive the morphological view of an urban structure. So far the application of space syntax principles to the s...

Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural induction and structural recursion. However, for graphs or ”tree-like” structures – trees involving cycles and sharing – it remains unclear what kind of inductive s...

Books describing novel approaches to machine translation (MT) are always welcome. This is all the more so when the approach is one not covered by general MT surveys such as those in Hutchins and Somers (1992) or Arnold et al. (1994). Bonnie Jean Dorr's Machine Translation: A View from the Lexicon is a book with a novel approach. It describes the interlingual MT system UNITRAN rooted in two Mass...

The learnability of abstract syntactic principles Children acquiring language infer the correct form of syntactic constructions for which they appear to have little or no direct evidence, avoiding simple but incorrect generalizations that would be consistent with the data they receive. These generalizations must be guided by some inductive bias – some abstract knowledge – that leads them to pre...

In this paper the methodological basis of the 'computational linguistics approach' for representing the meaning of natural language sentences is investigated. Its adherance to principles of formal linguistics and formal philosophy of language like the 'separation of levels of syntactic and semantic analysis', and the "Fregean" principle may be contrasted with the 'artificial intelligence approa...

the literary approach to quranic interpretations is founded on words, morphology, syntax and rhetoric. however, contemporary literary school, in addition to these principles, takes into account other principles like authenticating solely the literary understanding. comparing sayyid murtazā's literary approach with the principles and ideas of sheikh tusi in al-tibyan reveals various aspects...

Knowledge of the principles by which behavioral sequences are generated is essential to progress in our understanding of neural mechanisms. We describe here a set of natural principles or syntax rules that organize the components of grooming and feeding. The behavioral stream of facial grooming or of taste-elicited ingestive/aversive consummatory actions of rats can be viewed as a long series o...

This paper presents a method for implementing tableau algorithm for description logics (DLs). The architectures of the present DL reasoners such as RACER or FaCT were developed using programming languages as Java or LISP. The implementations are not based on original definition of the abstract syntax, but they require transformation of abstract syntax into concrete syntax implementation languag...