Quote: in a closed applicative language, the meaning of an application (.mu. * ap [e,f]) is .mu.*[.rho. .mu. e].mu.f

Note

a closed applicative language is an applicative language with a representation function mapping all constants to functions from all constants to expressions such that the semantic meaning of an application is .mu. * ap [e,f] = .mu.*[.rho..mu.e].mu.f where .mu. is semantic, representation is .rho. ap is application function and e, f are expressions.

Related Topics

Topic: reduction languages (17 items)