#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2014

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alvaro Tasistro, Ernesto Copello, Nora Szasz
- Electr. Notes Theor. Comput. Sci.
- 2015

In [7], Allen Stoughton proposed a notion of substitution for the Lambda calculus formulated in its original syntax with only one sort of symbols (names) for variables and without identifying α-convertible terms. According to such formulation, the action of substitution on terms is de ned by simple structural recursion and an interesting theory arises… (More)

- Ernesto Copello, Alvaro Tasistro, Nora Szasz, Ana Bove, Maribel Fernández
- Electr. Notes Theor. Comput. Sci.
- 2016

We formulate principles of induction and recursion for a variant of lambda calculus in its original syntax (i.e., with only one sort of names) where α-conversion is based upon name swapping as in nominal abstract syntax. The principles allow to work modulo α-conversion and implement the Barendregt variable convention. We derive them all from the simple… (More)

- Ernesto Copello, Alvaro Tasistro, Bruno Bianchi
- SBLP
- 2014

We present a full certification of merge sort in the language Agda. It features: termination warrant without explicit proof, no proof cost to ensure that the output is sorted, and a succinct proof that the output is a permutation of the input.

In [5], Allen Stoughton proposed a notion of substitution for the Lambda calculus formulated in its original syntax with only one sort of symbols (names) for variables –without identifying α-convertible terms. According to such formulation, the action of substitution on terms is defined by simple structural recursion and an interesting theory arises… (More)

- Ernesto Copello, Nora Szasz, Alvaro Tasistro
- Theor. Comput. Sci.
- 2017

- ‹
- 1
- ›