Sure, CLOS was the first that comes to mind. Shen has a 'static' type system which embeds a predicate calculus, thus being trivially Turing-complete, and not b

Sure, CLOS was the first that comes to mind. Shen has a 'static' type system which embeds a predicate calculus, thus being trivially Turing-complete, and not by accident.