Abstract The theory of stratified institutions is a general axiomatic approach to model theories where the satisfaction parameterized by states models. In this paper we further develop introducing new technique for representing institutions, which based on projecting such simpler structures. On one hand can be used developing results applicable wide variety already existing with states, as thos...

ions as aspect anchors Because concerns are irrelevant until the developer requires a certain level of detail, we can define a concern’s corresponding aspect in terms of the system abstractions inhabiting the stratum in which the concern first appears. One of the main challenges for weaverbased aspect-oriented approaches operating at the code level3 is expressing where in the code to apply an a...

In this paper we investigate some properties of "autoepistemic logic" approach to the formalization of common sense reasoning suggested by R. Moore in [Moore, 19851. In particular we present a class of autoepistemic theories (called stratified autoepistemic theories) and prove that theories from this class have unique stable autoepistemic expansions and hence a clear notion of "theoremhood". Th...

We present an index-typed core language, called Tores, that supports writing inductive proofs as total recursive programs. It allows us to reason directly by induction on index terms and by Mendler-style recursion on indexed recursive types. In addition, Tores offers stratified types that are defined by well-founded recursion on

Phonological processes and structures are often limited to a particular set of a language’s words, such as loanwords, Latinate words in English, or Yamato words in Japanese. Typically, the etymologically older, or “core” set of words is more restricted in the structures that it permits, and is (hence) subject to more processes. To capture such restrictions in Optimality Theory, Itô and Mester (...

We consider predicative type-abstraction disciplines based on type quantification with finitely stratified levels. The main technical result is that the functions representable in the finitely stratified polymorphic A-calculus are precisely the super-elementary functions, i.e. the class £4 in Grzegorczyk's subrecursive hierarchy. This implies that there is no super-elementary bound on the lengt...