2012 · 52 citations · 18 references
ComputingComputer ScienceLogicProgramming LanguagesTheory Of ComputationFormal SemanticsFunctional ProgrammingInterpreter DesignProof AssistantsType CheckingType SystemsAgdaBig-step SemanticsLambda Calculus SemanticsOperational SemanticsSmall-step SemanticsSoundnessType SoundnessVirtual Machines
The operational semantics of a partial, functional language is often given as a relation rather than as a function. The latter approach is arguably more natural: if the language is functional, why not take advantage of this when defining the semantics? One can immediately see that a functional semantics is deterministic and, in a constructive setting, computable.
18
Notions of computation and monads
Eugenio Moggi · Information and Computation · 1991 · 1.7K citations
Formal verification of a realistic compiler
Xavier Leroy · Communications of the ACM · 2009 · 1.1K citations
The essence of functional programming
Philip Wadler · 1992 · 676 citations · Full text
Definitional interpreters for higher-order programming languages
John Reynolds · 1972 · 668 citations