TILC: The Interactive Lambda-Calculus Tracer

نویسندگان

  • David Ruiz
  • Mateu Villaret
چکیده

This paper introduces TILC: the interactive lambda-calculus tracer. TILC aims to be a friendly user graphical application that helps teaching/studying the main basic concepts of pure untyped lambda-calculus. This is achieved by allowing users to graphically interact with a sort of parse-tree of the lambda-terms and automatically reproducing these interactions in the lambda-term. This graphical interaction encourages students to practice with lambda-terms easing the learning of the syntax and of the operational semantics of lambda-calculus. TILC has been built using HASKELL, wxHaskell and Happy, it can be freely downloaded from http://ima.udg.edu/~ villaret/tilc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gradual Information Flow Typing

We present a method to support the gradual evolution of secure scripts by formalizing an extension of the simply-typed lambda calculus that provides information flow constructs. These constructs allow initially insecure programs to evolve via targeted refactoring and to provide dynamic information flow guarantees via casts, as well as static information flow guarantees via labeled types.

متن کامل

The Proof-assistant

Yarrow is an interactive proof assistant based on the theory of Pure Type Systems, a family of typed lambda calculi. Yarrow has been designed as a exible environment for experimentation with various typed lambda calculi. It ooers both graphical and textual interfaces. It has been coded entirely in Haskell, making use of the Fudget library for the graphical interface. In this paper we concentrat...

متن کامل

The proof-assistant Yarrow

Yarrow is an interactive proof assistant based on the theory of Pure Type Systems, a family of typed lambda calculi. Yarrow has been designed as a flexible environment for experimentation with various typed lambda calculi. It offers both graphical and textual interfaces. It has been coded entirely in Haskell, making use of the Fudget library for the graphical interface. In this paper we concent...

متن کامل

Labeling techniques and typed fixed-point operators

Labeling techniques for untyped lambda calculus were developed by Lévy, Hyland, Wadsworth and others in the 1970’s. A typical application is the proof of confluence from finiteness of developments: by labeling each subterm with a natural number indicating the maximum number of times this term may participate in a reduction step, we obtain a strongly-normalizing approximation of β, η -reduction....

متن کامل

An Interactive Theorem Proving Assistant

This paper describes WinKE, an interactive proof assistant, which is based on the KE calculus. The software has been designed to serve as a tutoring system supporting the teaching of logic and theorem proving through KE.

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 248  شماره 

صفحات  -

تاریخ انتشار 2009