Higher-Order Partial Differentiation
نویسندگان
چکیده
منابع مشابه
Higher - Order Partial Differentiation 1 Noboru Endou
We use the following convention: m, n denote non empty elements of N, i, j denote elements of N, and Z denotes a set. One can prove the following propositions: (1) Let S, T be real normed spaces, f be a point of the real norm space of bounded linear operators from S into T , and r be a real number. Suppose 0 ≤ r and for every point x of S such that ‖x‖ ≤ 1 holds ‖f(x)‖ ≤ r · ‖x‖. Then ‖f‖ ≤ r. ...
متن کاملPartial Recursive Functions in Higher-Order Logic
Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for them. Our method expresses termination in a uniform manner and includes a very general form of pattern matching, where patterns can be arbitrary expressions. Termination proofs can be deferred, restricted to subsets of argument...
متن کاملPartial Type Inference with Higher-Order Types
The language MLF is an extension of System F that permits robust first-order partial type inference with second-order polymorphism. We propose an extension of MLF’s graphical presentation with higherorder types and reduction at the type level as in System Fω. As inference of higher-order types won’t be possible in general, the extension introduces System F-style explicit type abstraction and ty...
متن کاملReasoning with Higher Order Partial Functions
In this paper we introduce the logic P HOL, which embodies higher-order functions through a simply-typed-calculus and deals with partial objects by using partially ordered domains and three truth values. We deene a refutationally complete tableaux method for P HOL and we show how to derive a sound and complete cut free sequent calculus through a systematic analysis of the rules for tableaux con...
متن کاملHigher-Order Rewriting and Partial Evaluation
We demonstrate the usefulness of higher-order rewriting techniques for specializing programs, i.e., for partial evaluation. More precisely, we demonstrate how casting program specializers as combinatory reduction systems (CRSs) makes it possible to formalize the corresponding program transformations as meta-reductions, i.e., reductions in the internal “substitution calculus.” For partial-evalua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2012
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-012-0015-z