Weak Eigenvectors and the Functional Calculus
نویسندگان
چکیده
منابع مشابه
the effect of functional/notional approach on the proficiency level of efl learners and its evaluation through functional test
in fact, this study focused on the following questions: 1. is there any difference between the effect of functional/notional approach and the structural approaches to language teaching on the proficiency test of efl learners? 2. can a rather innovative language test referred to as "functional test" ge devised so so to measure the proficiency test of efl learners, and thus be as much reliable an...
15 صفحه اولSharing in the Weak Lambda-calculus Revisited
In a previous paper [2] which appeared in the volume celebrating Klop’s 60th anniversary, we presented a labeled lambda-calculus to characterize the dag implementation of the weak lambda-calculus as described in Wadsworth’s dissertation [11]. In this paper, we simplify this calculus and present a simpler proof of the sharing property which allows the dag implementation. In order to avoid duplic...
متن کاملWeak Equivalence in Propositional Calculus
The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versus resolution) idea: we succesively add complementary literals to already obtained clauses instead of solving them. Hence, the unsatisfiability of a formula is detected by reaching “a complete set of maximal clauses” instead of r...
متن کاملWeak linearization of the lambda calculus
We identify a restricted class of terms of the lambda calculus, here called weak linear, that includes the linear lambda-terms keeping their good properties of strong normalization, non-duplicating reductions and typability in polynomial time. The advantage of this class over the linear lambda-calculus is the possibility of transforming general terms into weak linear terms with the same normal ...
متن کاملSharing in the Weak Lambda-Calculus
Despite decades of research in the λ-calculus, the syntactic properties of the weak λ-calculus did not receive great attention. However, this theory is more relevant for the implementation of programming languages than the usual theory of the strong λ-calculus. In fact, the frameworks of weak explicit substitutions, or computational monads, or λ-calculus with a let statement, or super-combinato...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1963
ISSN: 0002-9947
DOI: 10.2307/1993849