-
Notifications
You must be signed in to change notification settings - Fork 4
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
4f2006d
commit 823b174
Showing
2 changed files
with
140 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,82 @@ | ||
use core::hash::Hash; | ||
use dedukti_parse::{term, Command, Intro, Lazy, Symb}; | ||
use std::collections::{HashMap, HashSet}; | ||
|
||
fn map_atoms<A, B, V>(t: term::Term<A, V>, f: &impl Fn(A) -> term::Term<B, V>) -> term::Term<B, V> { | ||
use term::AppH; | ||
let args = t.args.into_iter().map(|a| map_atoms(a, f)); | ||
let head = match t.head { | ||
AppH::Atom(a) => { | ||
let b = f(a); | ||
return term::Term { | ||
head: b.head, | ||
args: b.args.into_iter().chain(args).collect(), | ||
}; | ||
} | ||
AppH::Abst(v, ty, tm) => AppH::Abst( | ||
v, | ||
ty.map(|t| Box::new(map_atoms(*t, f))), | ||
Box::new(map_atoms(*tm, f)), | ||
), | ||
AppH::Prod(v, ty, tm) => AppH::Prod( | ||
v, | ||
Box::new(map_atoms(*ty, f)), | ||
Box::new(map_atoms(*tm, f)), | ||
), | ||
}; | ||
let args = args.collect(); | ||
term::Term { head, args } | ||
} | ||
|
||
fn subst<A: Clone + Eq + Hash, V: Clone>( | ||
map: &HashMap<A, term::Term<A, V>>, | ||
t: term::Term<A, V>, | ||
) -> term::Term<A, V> { | ||
map_atoms(t, &|a| match map.get(&a) { | ||
None => term::Term { | ||
head: term::AppH::Atom(a), | ||
args: Vec::new(), | ||
}, | ||
Some(t) => t.clone(), | ||
}) | ||
} | ||
|
||
fn main() -> std::io::Result<()> { | ||
let mut map = HashMap::new(); | ||
|
||
use std::fs::File; | ||
use std::io::{BufRead, BufReader}; | ||
|
||
let args: Vec<String> = std::env::args().collect(); | ||
let set: Result<HashSet<String>, _> = BufReader::new(File::open(&args[2])?).lines().collect(); | ||
let set = set?; | ||
|
||
let file = File::open(&args[1])?; | ||
let reader = BufReader::new(file); | ||
|
||
let cmds = Lazy::<_, _, String>::new(reader.lines().map(|l| l.unwrap())); | ||
for cmd in cmds { | ||
let cmd = cmd.unwrap(); | ||
//println!("{cmd:?}"); | ||
|
||
match cmd { | ||
Command::Intro(name, args, Intro::Definition(_, Some(tm)) | Intro::Theorem(_, tm)) if set.contains(&name) && args.is_empty() => { | ||
map.insert(Symb::new(name), subst(&map, tm)); | ||
} | ||
Command::Intro(name, args, intro) => { | ||
let args = args | ||
.into_iter() | ||
.map(|(v, ty)| (v, subst(&map, ty))) | ||
.collect(); | ||
let intro = intro | ||
.map_type(|t| subst(&map, t)) | ||
.map_term(|t| subst(&map, t)); | ||
println!("{}.", Command::Intro(name, args, intro)); | ||
|
||
} | ||
cmd @ Command::Rules(..) => println!("{cmd}."), | ||
} | ||
} | ||
|
||
Ok(()) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,58 @@ | ||
//! For every constant appearing in a Dedukti file, output its number of occurrences. | ||
use core::hash::Hash; | ||
use dedukti_parse::{term, Command, Lazy, Symb}; | ||
use std::collections::HashMap; | ||
|
||
fn atoms<A, V>(t: &term::Term<A, V>) -> Box<dyn Iterator<Item = &A> + '_> { | ||
use term::AppH; | ||
let head = match &t.head { | ||
AppH::Atom(a) => Box::new(core::iter::once(a)) as Box<dyn Iterator<Item = _>>, | ||
AppH::Abst(_, ty, tm) => Box::new(ty.iter().flat_map(|ty| atoms(ty)).chain(atoms(tm))), | ||
AppH::Prod(_, ty, tm) => Box::new(atoms(ty).chain(atoms(tm))), | ||
}; | ||
Box::new(head.chain(t.args.iter().flat_map(|a| atoms(a)))) | ||
} | ||
|
||
fn insert<C: Clone + Eq + Hash>(map: &mut HashMap<C, usize>, a: &term::Atom<C>) { | ||
if let term::Atom::Const(c) = a { | ||
*map.entry(c.clone()).or_default() += 1; | ||
} | ||
} | ||
|
||
fn main() -> std::io::Result<()> { | ||
use std::fs::File; | ||
use std::io::{BufRead, BufReader}; | ||
|
||
let mut map = HashMap::new(); | ||
let f = |m: &mut _, t: &_| atoms(t).for_each(|a| insert(m, a)); | ||
|
||
let args: Vec<String> = std::env::args().collect(); | ||
let file = File::open(&args[1])?; | ||
let reader = BufReader::new(file); | ||
|
||
let cmds = Lazy::<_, _, String>::new(reader.lines().map(|l| l.unwrap())); | ||
for cmd in cmds { | ||
let cmd = cmd.unwrap(); | ||
//println!("{cmd:?}"); | ||
|
||
if let Command::Intro(name, args, intro) = cmd { | ||
map.insert(Symb::new(name), 0); | ||
args.iter().for_each(|(_, t)| f(&mut map, &t)); | ||
intro | ||
.map_type(|t| { | ||
f(&mut map, &t); | ||
t | ||
}) | ||
.map_term(|t| { | ||
f(&mut map, &t); | ||
t | ||
}); | ||
} | ||
} | ||
|
||
for (sym, count) in map { | ||
println!("{count}\t{sym}"); | ||
} | ||
Ok(()) | ||
} |