Add to ORKGAbstract—A core programming language is presented that allows structural recursion over open LF objects and contexts. The main technical tool is a coverage checking algorithm that also generates valid recursive calls. Termination of call-by-value reduction is proven using a reducibility semantics. This establishes consistency and allows the implementation of proofs about LF specifications as well-founded recursive functions using simultaneous pattern matching. I
Recursion is considered a challenging programming technique by many students. There are two common a...
Best student paper award.International audienceAutomatic parallelization of recursive programs is st...
Almost all modern imperative programming languages include operations for dynamically manipulating t...
Abstract—A core programming language is presented that allows structural recursion over open LF obje...
We present a core programming language that supports writing well-founded structurally recur-sive fu...
We present a core programming language that supports writing well-founded structurally recursive fun...
Abstract. LFC is a functional language based on recursive functions defined on context-free language...
We propose a programming paradigm that tries to get close to both the semantic simplicity of relatio...
International audienceIn call-by-value languages, some mutually-recursive definitions can be safely ...
We propose a programming paradigm that tries to get close to both the semantic simplicity of rela-ti...
62 pages, uses pic.International audienceThis paper formalizes and proves correct a compilation sche...
Abstract. Concurrent compositions of recursive programs with finite data are a natural abstraction m...
In order to build a data structure that is extensible and reusable, it is necessary to decouple the ...
In this paper we explain how recursion operators can be used to structure and reason about program s...
Accepted paper to FSTTCS'13We study a model for recursive functional programs called, higher order r...
Recursion is considered a challenging programming technique by many students. There are two common a...
Best student paper award.International audienceAutomatic parallelization of recursive programs is st...
Almost all modern imperative programming languages include operations for dynamically manipulating t...
Abstract—A core programming language is presented that allows structural recursion over open LF obje...
We present a core programming language that supports writing well-founded structurally recur-sive fu...
We present a core programming language that supports writing well-founded structurally recursive fun...
Abstract. LFC is a functional language based on recursive functions defined on context-free language...
We propose a programming paradigm that tries to get close to both the semantic simplicity of relatio...
International audienceIn call-by-value languages, some mutually-recursive definitions can be safely ...
We propose a programming paradigm that tries to get close to both the semantic simplicity of rela-ti...
62 pages, uses pic.International audienceThis paper formalizes and proves correct a compilation sche...
Abstract. Concurrent compositions of recursive programs with finite data are a natural abstraction m...
In order to build a data structure that is extensible and reusable, it is necessary to decouple the ...
In this paper we explain how recursion operators can be used to structure and reason about program s...
Accepted paper to FSTTCS'13We study a model for recursive functional programs called, higher order r...
Recursion is considered a challenging programming technique by many students. There are two common a...
Best student paper award.International audienceAutomatic parallelization of recursive programs is st...
Almost all modern imperative programming languages include operations for dynamically manipulating t...