Algebraic Approaches To Program Semantics

In The 1930s, Mathematical Logicians Studied The Notion Of Effective Comput Ability Using Such Notions As Recursive Functions, A-calculus, And Turing Machines. The 1940s Saw The Construction Of The First Electronic Computers, And The Next 20 Years Saw The Evolution Of Higher-level Programming Languages In Which Programs Could Be Written In A Convenient Fashion Independent (thanks To Compilers And Interpreters) Of The Architecture Of Any Specific Machine. The Development Of Such Languages Led In Turn To The General Analysis Of Questions Of Syntax, Structuring Strings Of Symbols Which Could Count As Legal Programs, And Semantics, Determining The Meaning Of A Program, For Example, As The Function It Computes In Transforming Input Data To Output Results.