229 search results - page 14 / 46 » Natural Language Proof Explanation |
TPHOL
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
ESOP
2006
Springer
13 years 10 months ago
2006
Springer
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to d...
AIEDU
2005
13 years 6 months ago
2005
In this paper, we explore the problem of selecting appropriate interventions for students based on an analysis of their interactions with a tutoring system. In the context of the W...
SIGCSE
1997
ACM
13 years 11 months ago
1997
ACM
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
FOSSACS
2012
Springer
12 years 2 months ago
2012
Springer
We study type-directed encodings of the simply-typed λ-calculus in a session-typed π-calculus. The translations proceed in two steps: standard embeddings of simply-typed λ-calcu...