#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2014

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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 dened by simple structural recursion and an interesting theory arises… (More)

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)

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

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

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

- 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.

- ‹
- 1
- ›