The lamda-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses βη-conversion to prove equivalence of programs, then a gross simplification 1 is introduced. We give a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence of programs, independent from any specific computational model
This paper shows equivalence of several versions of applicative similarityand contextual approximati...
Moggi proposed a monadic account of computational effects. He also presented the computational lamd...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
The lamda-calculus is considered an useful mathematical tool in the study of programming languages. ...
The λ-calculus is considered an useful mathematical tool in the study of programming languages, sinc...
AbstractThe λ-calculus is considered a useful mathematical tool in the study of programming language...
Abstract. Software security can be ensured by specifying and verifying security properties of softwa...
This thesis studies various manifestations of monads in the mathematics of computation and presents ...
AbstractLambda-SF-calculus can represent programs as closed normal forms. In turn, all closed normal...
AbstractWe introduce direct categorical models for the computational lambda-calculus. Direct models ...
We present an algebra that is intended to bridge the gap between programming formalisms that have a ...
This paper is a contribution to the search for efficient and high-levelmathematical tools to specify...
The main aim of this paper is to formulate "natural" logical foundations for type-free lambda-calcul...
© 2019 Association for Computing Machinery. Closure calculus is simpler than pure lambda-calculus as...
This paper shows equivalence of several versions of applicative similarity and contextual approximat...
This paper shows equivalence of several versions of applicative similarityand contextual approximati...
Moggi proposed a monadic account of computational effects. He also presented the computational lamd...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
The lamda-calculus is considered an useful mathematical tool in the study of programming languages. ...
The λ-calculus is considered an useful mathematical tool in the study of programming languages, sinc...
AbstractThe λ-calculus is considered a useful mathematical tool in the study of programming language...
Abstract. Software security can be ensured by specifying and verifying security properties of softwa...
This thesis studies various manifestations of monads in the mathematics of computation and presents ...
AbstractLambda-SF-calculus can represent programs as closed normal forms. In turn, all closed normal...
AbstractWe introduce direct categorical models for the computational lambda-calculus. Direct models ...
We present an algebra that is intended to bridge the gap between programming formalisms that have a ...
This paper is a contribution to the search for efficient and high-levelmathematical tools to specify...
The main aim of this paper is to formulate "natural" logical foundations for type-free lambda-calcul...
© 2019 Association for Computing Machinery. Closure calculus is simpler than pure lambda-calculus as...
This paper shows equivalence of several versions of applicative similarity and contextual approximat...
This paper shows equivalence of several versions of applicative similarityand contextual approximati...
Moggi proposed a monadic account of computational effects. He also presented the computational lamd...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
DOI
Add to ORKG