Add to ORKGWe introduced the notion of continuation in lambda calculus for Lambek calculus and showed that the continuation-passing style transformation could be naturally derived from the rules of Lambek calculus. Furthermore, since the answer category of a continuation is given when the whole sentence is determined, we introduced a polymorphic category and generalized the continuation-passing style transformation in the polymorphic Lambek calculus
In the field of program transformation, one often transforms programs into continuation-passing styl...
This thesis joins my four articles: (1) Confluence of the lambda calculus with left-linear algebraic...
This working paper introduces CONTINUATIONS (a concept borrowed from computer science) as a new tech...
AbstractCategorial grammars in the tradition of Lambek are asymmetric: sequent statements are of the...
Laboratory for Foundations of Computer ScienceThis thesis attempts to make precise the structure inh...
AbstractCategorial grammars in the tradition of Lambek are asymmetric: sequent statements are of the...
International audienceThere is a correspondence between classical logic and programming language cal...
International audienceThere is a correspondence between classical logic and programming language cal...
International audienceThere is a correspondence between classical logic and programming language cal...
Plotkin's -value calculus is sound but incomplete for reasoning about -transfor-mations on prog...
AbstractThe purpose of this paper is to investigate the programs with continuations in the framework...
The essence of compiling with continuations is that conversion to continuation-passing style (CPS) i...
Programs with control are usually modeled using lambda calculus extended with control operators. Ins...
Programs with control are usually modeled using lambda calculus extended with control operators. Ins...
Abstract. Categorial grammars in the tradition of Lambek [1,2] are asymmetric: sequent statements ar...
In the field of program transformation, one often transforms programs into continuation-passing styl...
This thesis joins my four articles: (1) Confluence of the lambda calculus with left-linear algebraic...
This working paper introduces CONTINUATIONS (a concept borrowed from computer science) as a new tech...
AbstractCategorial grammars in the tradition of Lambek are asymmetric: sequent statements are of the...
Laboratory for Foundations of Computer ScienceThis thesis attempts to make precise the structure inh...
AbstractCategorial grammars in the tradition of Lambek are asymmetric: sequent statements are of the...
International audienceThere is a correspondence between classical logic and programming language cal...
International audienceThere is a correspondence between classical logic and programming language cal...
International audienceThere is a correspondence between classical logic and programming language cal...
Plotkin's -value calculus is sound but incomplete for reasoning about -transfor-mations on prog...
AbstractThe purpose of this paper is to investigate the programs with continuations in the framework...
The essence of compiling with continuations is that conversion to continuation-passing style (CPS) i...
Programs with control are usually modeled using lambda calculus extended with control operators. Ins...
Programs with control are usually modeled using lambda calculus extended with control operators. Ins...
Abstract. Categorial grammars in the tradition of Lambek [1,2] are asymmetric: sequent statements ar...
In the field of program transformation, one often transforms programs into continuation-passing styl...
This thesis joins my four articles: (1) Confluence of the lambda calculus with left-linear algebraic...
This working paper introduces CONTINUATIONS (a concept borrowed from computer science) as a new tech...