Results 201 to 210 of about 129,017 (253)

The formal semantics of programming languages - an introduction

Foundation of computing series, 1993
"The Formal Semantics of Programming Languages" provides the basic mathematical techniques necessary for those who are beginning a study of semantics and logics of programming languages. Although the treatment is elementary, several of the topics covered
G. Winskel
semanticscholar   +1 more source

Automatic Equivalence Structures of Polynomial Growth

Annual Conference for Computer Science Logic, 2020
In this paper we study the class EqP of automatic equivalence structures of the form E = (D, E) where the domain D is a regular language of polynomial growth and E is an equivalence relation on D. Our goal is to investigate the following two foundational
Moses Ganardi, B. Khoussainov
semanticscholar   +1 more source

Formal Model Extraction for Combinational Equivalence Checking

, 2012
In formal verification, the first step is to build a formal model. Most of the academic tools represent the designs in BLIF or BLIF-MV network, while cannot directly take Verilog source code as an input.
Guiling Zhang   +5 more
semanticscholar   +1 more source

On the Representation of Formal Languages Using Automata on Networks

Scandinavian Workshop on Algorithm Theory, 1969
A new model of abstract automata is presented employing the concept of finite automata on a network. Each normal network n provided with a one-way input tape determines a family of languages nl.
Gerald A. Fischer, G. N. Raney
semanticscholar   +1 more source

The Problem of Equivalence in Translation

, 2020
This research is concerned with the examination of the problem of equivalence in translation. By definition, translation is a process that deals with transferring meaning across different languages as well as cultures.
M. Enani, K. Tawfik, Samah Emam Omar
semanticscholar   +1 more source

Three English adverbs and their formal equivalents in Romance languages: A corpus-based collocational study

Languages in Contrast, 2008
This paper builds on previous work on the properties of the adverbs 'basically', 'essentially' and 'fundamentally' and their formal equivalents in Spanish, extending the collocational part of this work to include three more Romance languages, Portuguese, French and Italian, the last two of which lack any systematic use of formal equivalents of ...
openaire   +2 more sources

Studies on the Learnability of Formal Languages via Queries

, 1998
Studies on the Learnability of Formal Languages via Queries Hiroshi Sakamoto Kyushu U niv rsity 1998 Th pres nt th sis d als with the l arnability of formal languages via queries based on Angluin' [6] learning protocol. Assuming a class of concepts and a
坂本 比呂志   +2 more
semanticscholar   +1 more source

Bialgebraic Reasoning on Stateful Languages

arXiv.org
Reasoning about program equivalence in imperative languages is notoriously challenging, as the presence of states (in the form of variable stores) fundamentally increases the observational power of program terms.
Sergey Goncharov   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy