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 95
Pagina 323
... Reduction machines are specifically designed for the execution of these functional languages . Böhm and Gross [ 13 ] and Landin [ 58 , 59 , 60 ] were the first to suggest the importance of lambda calculus for programming . In fact ...
... Reduction machines are specifically designed for the execution of these functional languages . Böhm and Gross [ 13 ] and Landin [ 58 , 59 , 60 ] were the first to suggest the importance of lambda calculus for programming . In fact ...
Pagina 379
... reduction is ( B ) red ( 2x : σ.M ) N [ N / x ] M , where [ N / x ] M is the result of substituting N for free occurrences of x in M. For example , the value of Af : o → o.fx applied to λy : o.y may be calculated by substituting the ...
... reduction is ( B ) red ( 2x : σ.M ) N [ N / x ] M , where [ N / x ] M is the result of substituting N for free occurrences of x in M. For example , the value of Af : o → o.fx applied to λy : o.y may be calculated by substituting the ...
Pagina 380
... reduction paths . Suppose M reduces to normal form N1 , and M →→ N2 is an alternate reduction with N2 not in normal form . Although M →→ N2 may M- not lead to the shortest reduction to normal form , there is no irreparable harm in ...
... reduction paths . Suppose M reduces to normal form N1 , and M →→ N2 is an alternate reduction with N2 not in normal form . Although M →→ N2 may M- not lead to the shortest reduction to normal form , there is no irreparable harm in ...
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