Operational Semantics: Computer Science, Computer Program, Formal Semantics of Programming Languages, Axiomatic Semantics - Tapa blanda

 
9786130356149: Operational Semantics: Computer Science, Computer Program, Formal Semantics of Programming Languages, Axiomatic Semantics
Tapa blanda
ISBN 10: 6130356145 ISBN 13: 9786130356149
Editorial: Betascript Publishers, 2010

Sinopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, operational semantics is a way to give meaning to computer programs in a mathematically rigorous way. Other approaches to providing a formal semantics of programming languages include axiomatic semantics and denotational semantics.The operational semantics for a programming language describes how a valid program is interpreted as sequences of computational steps. These sequences then are the meaning of the program. In the context of functional programs, the final step in a terminating sequence returns the value of the program. (In general there can be many return values for a single program, because the program could be nondeterministic, and even for a deterministic program there can be many computation sequences since the semantics may not specify exactly what sequence of operations arrives at that value.)

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, operational semantics is a way to give meaning to computer programs in a mathematically rigorous way. Other approaches to providing a formal semantics of programming languages include axiomatic semantics and denotational semantics.The operational semantics for a programming language describes how a valid program is interpreted as sequences of computational steps. These sequences then are the meaning of the program. In the context of functional programs, the final step in a terminating sequence returns the value of the program. (In general there can be many return values for a single program, because the program could be nondeterministic, and even for a deterministic program there can be many computation sequences since the semantics may not specify exactly what sequence of operations arrives at that value.)

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Betascript Publishers
Año de publicación
2010
Idioma
Inglés
ISBN 10 
6130356145
ISBN 13 
9786130356149
Encuadernación
Tapa blanda
Número de páginas
68
Editor
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Contacto del fabricante
no disponible
Persona responsable
no disponible