Formal language

About: Formal language is a research topic. Over the lifetime, 5763 publications have been published within this topic receiving 154114 citations.

"Situations, Language and Logic"

Abstract: I. Introduction.- 1. Prom linguistic form to situation schemata.- 2. Interpreting situation schemata.- 3. The logical point of view.- II. From Linguistic Form to Situation Schemata.- 1. Levels of linguistic form determining meaning.- 2. Motivation for the use of constraints.- 3. The modularization of the mapping from form to meaning.- 4. Situation schemata.- 5. The algorithm from linguistic form to situation schemata.- III. Interpreting Situation Schemata.- 1. The art of interpretation.- 2. The inductive definition of the meaning relation.- 3. A remark on the general format of situation schemata.- 4. Generalizing generalized quantifiers.- IV. A Logical Perspective.- 1. The mechanics of interpretation.- 2. A hierarchy of formal languages.- 2.1. Propositional logic.- 2.2. Predicate logic.- 2.3. Tense logic.- 2.4. Temporal predicate logic.- 2.5. Situated temporal predicate logic.- 3. Mathematical study of some formal languages.- 3.1. Definition of structure.- 3.2. The system L3.- 3.3. Modal operators.- 4. On the model theoretic interpretation of situation schemata.- 4.1. The basic correspondence.- 4.2. The correspondence extended.- V. Conclusions.- Appendices.- A. Prepositional Phrases in Situation Schemata.- by Erik Colban.- B. A Lyndon type interpretation theorem for many-sorted first-order logic.- C. Proof of the relative saturation lemma.- References.

Winskel is (almost) right : Towards a mechanized semantics textbook

Abstract: We present a formalization of the first 100 pages of Winskel's textbook The Formal Semantics of Programming Languages in the theorem prover Isabelle/HOL: 2 operational, 2 denotational, 2 axiomatic semantics, a verification condition generator, and the necessary soundness, completeness and equivalence proofs, all for a simple imperative programming language.

Rational algebraic theories and fixed-point solutions

Abstract: In a wide variety of situations, computer science has found it convenient to define complex object as (fixed-point) solutions of certain equations. This has been done in both algebraic and order-theoretic settings, and has often been contrasted with other approaches. This paper shows how to formulate such solutions in a setting which encompasses both algebraic and order-theoretic aspects, so that the advantages of both worlds are available. Moreover, we try to show how this is consistent with other approaches to defining complex objects, through a number of applications, including: languages defined by context-free grammars; flow charts and their interpretations; and monadic recursive program schemes. The main mathematical results concern free rational theories and quotients of rational theories. However, the main goal has been to open up what we believe to be a beautiful and powerful new approach to the syntax and semantics of complex recursive specifications.

Logic Grammars

Abstract: Logic grammars have found wide application both in natural language processing and in formal applications such as compiler writing. This book introduces the main concepts involving natural and formal language processing in logic programming, and discusses typical problems which the reader may encounter, proposing various methods for solving them. The basic material is presented in depth; advanced material, involving new logic grammar formalisms and applications, is presented with a view towards breadth. Major sections of the book include: grammars for formal language and linguistic research, writing a simple logic grammar, different types of logic grammars, applications, and logic grammars and concurrency. This book is intended for those interested in logic programming, artificial intelligence, computational linguistics, Fifth Generation computing, formal languages and compiling techniques. It may be read profitably by upper-level undergraduates, post-graduate students, and active researchers on the above-named areas. Some familiarity with Prolog and logic programming would be helpful; the authors, however, briefly describe Prolog and its relation to logic grammars. After reading Logic Grammars, the reader will be able to cope with the ever-increasing literature of this new and exciting field.

A Formal Mapping between UML Models and Object-Z Specifications

Abstract: This paper presents a precise and descriptive semantics for core modeling concepts in Object-Z and a formal description for UML class constructs. Given the formal descriptions, it also provides a formal semantic mapping between the two languages at the meta-level, which makes our translation more systematic. Any verification of UML models can take place on their corresponding Object-Z specifications using reasoning techniques provided for Object-Z. With this approach, we provide not only a precise semantic basis for UML but also a sound mechanism for reasoning about UML models.