Handbook of Theoretical Computer ScienceJan van Leeuwen, Jan Leeuwen Elsevier Science, 15 nov 2005 - 2269 pagina's Presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing. |
Vanuit het boek
Resultaten 1-3 van 63
Pagina 405
... axioms for these four maps correspond exactly to the conditions imposed on dom , cod , id and comp in the definition ... axioms . To make the axioms easier to read , let us write σ , t , ... for variables of sort typ and M , N , ... for ...
... axioms for these four maps correspond exactly to the conditions imposed on dom , cod , id and comp in the definition ... axioms . To make the axioms easier to read , let us write σ , t , ... for variables of sort typ and M , N , ... for ...
Pagina 406
... axioms are relatively straightforward , except in the case of lambda abstraction ( → Intro ) . Intuitively , the substitution axiom for pairing M : o tɅ N : o⇒p ^ P : v⇒σ subst ( crossI ( M , N ) , P ) = crossI ( subst ( M , P ) ...
... axioms are relatively straightforward , except in the case of lambda abstraction ( → Intro ) . Intuitively , the substitution axiom for pairing M : o tɅ N : o⇒p ^ P : v⇒σ subst ( crossI ( M , N ) , P ) = crossI ( subst ( M , P ) ...
Pagina 701
... axioms of LOOSE - SET . There exist uncountably many partitions p : POset → { 0 , 1 } . Hence , Mod ( LOOSE - SET ) is uncountable . LOOSE - SET can be made to a monomorphic specification by adding two axioms : spec SETNAT = extend ...
... axioms of LOOSE - SET . There exist uncountably many partitions p : POset → { 0 , 1 } . Hence , Mod ( LOOSE - SET ) is uncountable . LOOSE - SET can be made to a monomorphic specification by adding two axioms : spec SETNAT = extend ...
Inhoudsopgave
Dominique PERRIN | 3 |
PREFACE LIST OF CONTRIBUTORS TO VOLUME B CONTENTS CHAPTER 1 FINITE AUTOMATA D Perrin 1 Introduction | 4 |
Finite automata and recognizable sets | 10 |
Copyright | |
41 andere gedeelten niet getoond
Overige edities - Alles bekijken
Veelvoorkomende woorden en zinsdelen
A₁ abstraction algebraic algorithm alphabet applicative structure automaton axioms B₁ Berlin binary Büchi automata Cartesian closed categories Church-Rosser clause complete Computer Science congruence consider context-free grammar context-free languages Corollary Courcelle critical pairs defined definition denote derivation Dershowitz deterministic elements empty equations example exists expressions F-algebra first-order formula free variable function Functional Programming given graph Hence Henkin models Herbrand hypergraphs induction infinite trees integer interpretation lambda abstraction Lecture Notes Lemma logic programming logical relations mapping monadic monadic second-order monoid morphism multiset natural numbers nonempty normal form Notes in Computer notion operations ordering polymorphic predicate problem Proc program schemes programming languages proof properties Proposition prove recursive reduction regular result rewriting systems satisfying second-order logic Section semantics sequence Springer subset substitution subterm symbols Symp t₁ terminating Theorem theory tree automata tree automaton type inference typed lambda calculus U₁ w-languages w-words word