Commit ba8bd4b5 authored by Andrei Paskevich's avatar Andrei Paskevich

remove trailing whitespace, tabs, and latin1 characters

parent 37f06a22
......@@ -50,7 +50,9 @@
* choisir un logo
=== Roadmap for third release ==========================================
=== Roadmap for third release 0.70 =======================================
* increment the magic number in config (A)
* enlever les caracteres de tab des sources
et les caracteres latin1 (A)
......
(* Correctness of a program computing the minimal distance between
two words (code by Claude Marché).
two words (code by Claude Marché).
This program computes a variant of the Levenshtein distance. Given
two strings [w1] and [w2] of respective lengths [n1] and [n2], it
......
(**************************************************************************)
(* *)
(* Copyright (C) 2010-2011 *)
(* François Bobot *)
(* Jean-Christophe Filliâtre *)
(* Claude Marché *)
(* Andrei Paskevich *)
(* *)
(* This software is free software; you can redistribute it and/or *)
(* modify it under the terms of the GNU Library General Public *)
(* License version 2.1, with the special exception on linking *)
(* described in file LICENSE. *)
(* *)
(* This software is distributed in the hope that it will be useful, *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *)
(* *)
(**************************************************************************)
(* distance of two terms *)
let dist_bool b = if b then 0.0 else 1.0
......
(**************************************************************************)
(* *)
(* Copyright (C) 2010-2011 *)
(* François Bobot *)
(* Jean-Christophe Filliâtre *)
(* Claude Marché *)
(* Andrei Paskevich *)
(* *)
(* This software is free software; you can redistribute it and/or *)
(* modify it under the terms of the GNU Library General Public *)
(* License version 2.1, with the special exception on linking *)
(* described in file LICENSE. *)
(* *)
(* This software is distributed in the hope that it will be useful, *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *)
(* *)
(**************************************************************************)
val t_dist : term -> term -> float
(** returns an heuristic distance between the two given terms. The
result is always between 0.0 and 1.0. It is guaranteed that if
......
......@@ -18,12 +18,11 @@
(**************************************************************************)
(** The aim of this translation is to obtain terms where all epsilon
* abstractions are closed *)
abstractions are closed *)
(** We do this by applying the following rewriting rule:
εx.P(x) => εF.(P(F@y₁@...@y_n)) where y₁...y_n are the free variable in P and
@ is the higher-order application symbol.
*)
eps x.P(x) => eps F.(P(F@y_1@...@y_n)) where y_1...y_n are
the free variables in P and @ is the higher-order application symbol. *)
open Term
......
......@@ -16,3 +16,4 @@
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *)
(* *)
(**************************************************************************)
......@@ -16,3 +16,4 @@
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *)
(* *)
(**************************************************************************)
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment