32 results about "Functional programming" patented technology

The disclosed system provides a transformation-based implementation of forward-mode and reverse-mode automatic differentiation as a built-in, first-class function in a functional programming language. Each of these constructs imposes only a small constant factor of the computational burden (time) of the function itself, and the forward construct has the same properties in terms of space. The functions can be applied to any function, including those involving derivatives and nested closures.

A system and method are provided for enabling an efficient processing environment for a functional programming language runtime machine. Separate processors are provided for the main FP processor and the garbage collector as well as separate access to the heap. The routine maintenance performed by the garbage collector does not compete for resources of the main FP processor. The processor implementation for the main FP processor also includes a separate bus to each of the program memory, the heap, and the stacks.

A bidirectional text display method embodied in a functional programming language which first assigns bidirectional attributes to a logical character stream. Next, through explicit processing, level numbers are assigned, honoring any directional overrides present in the logical character stream. Subsequent weak and neutral type processing potentially causes attribute types to change based upon surrounding attribute types. Then, implicit processing assigns final level numbers to the stream which control reordering. Finally, reordering processing produces a sequence of characters in display order. By separating the facets of layout dealing with reordering from those that are concerned with rendering, such as line breaking, glyph selection, and shaping, the Haskell-based method is more discernible and comprehendable, thereby allowing it to be more useful as a model upon which others may base bidirectional implementations.

An exemplary embodiment of a system, method and / or computer program product for creating a fare analytic database, may include: receiving, by at least one processor, fare(s) and fare related data; and creating a graph database of the fare(s) and fare related data; where the creating may include: creating one or more node(s) of the graph database representing at least one component of the fare and fare related data; creating one or more relationship(s) between a plurality of the nodes; and applying at least one property to the node(s) and the relationship(s). A fare analytic engine may further incorporate the database, and the engine may process queries traversing the database for fare and fare related data; and functional programming methods may be used to generate Boolean byte code routines from fare restrictions, according to exemplary embodiments disclosed.

A method for information flow tracking is provided using, for example, a functional programming language based on lambda calculus, λI. The method provides a unified information-tracking framework that supports multiple, interdependent dimensions of information. An expressive policy-specification system is separated from the underlying information-flow tracking mechanism. Arbitrary domain-specific policies are supported that can be developed and enforced independent of information flow tracking. Information-flow metadata is treated as a first-class entity, and information flow is correctly tracked on the metadata itself. Classes of information flow polices are defined using multiple dimensions that are application to both information flow data and to the information flows themselves. These classes of polices accurately model more realistic security policies, based on partial trust relations. Therefore, multiple interdependent dimensions of information are simultaneously tracked and enforced within the framework of the information flow tracking system.

Disclosed herein are systems and methods for executing programs written in functional style. A distributed computing system receives a program that expresses computation upon one or more sets of distributed key-value pairs (DKVs) and one or more global variables (GVs). The system distributes an assembly that includes at least a compiled binary of the program to the nodes of a computing cluster, with different portions of the DKVs being stored across the plurality of nodes of the computing cluster. The system causes execution of the assembly by each of the plurality of nodes of the computing cluster, the ones of the plurality of nodes executing the assembly using the different portions of the one or more DKVs stored thereon.

The invention discloses a high-level comprehensive method and system for graph computing, belonging to the field of big data processing, including: (1) generating a graph computing program according to a point-centered functional programming model; (2) adding optimization instructions Specify architecture parameters and microarchitecture parameters; (3) Compile the graph calculation program into a modular data flow intermediate representation according to the data flow graph and optimization instructions; (4) According to the mapping relationship between the IR module and the hardware template, convert the data flow intermediate Indicates that it is mapped to the underlying architecture, and instantiates the pipeline and buffer in the hardware template; (5) if each instantiated parameterized hardware template and the overall architecture meet the constraints, then go to step (6); otherwise, modify and optimize Go to step (3) after the instruction; (6) generate synthesizable hardware language code. The invention can provide effective support for generating graph application RTL from an upper layer language, so as to improve the parallelism of graph calculation executed on FPGA.

The invention provides a device for programming the functions of a monitor, which comprises a memory, a program code programming device and a program code checking module. The memory is used for storing program codes. The program code programming device is coupled with the memory and used for reading a program code with a preset length from the memory, and the program code with a preset length ispart of the program codes. The program code checking module is coupled with the program code programming device and used for checking whether the program code with a preset length conforms to a preset state and generating a control signal; and the program code programming device is controlled by the control signal to determine whether the program code with a preset length is to be written into the memory of a monitor.

The present invention is a kind of multi-task compiling method based on graphical guard-style command calculus, relates to a graphical guard-style command calculus GCC_graph automatic compiling method to generate executable multi-task Ada / C code, for the GCC_graph program input by the designer, the The compiler automatically compiles it to generate the corresponding executable multi-task Ada / C code. All the functions of the compiler are implemented by the functional programming language CAML programming. Since CAML is a safe language, the CAML program is verified by its own compiler before execution. In addition, the compiler designed by the present invention uses a modular structure, once the program changes, we only need to modify the code of the corresponding module.

The invention discloses a method for supporting large scale parallel distributed computation through functional programming model. The method comprises the following steps: firstly, converting realization codes to function formulae based on process; then, eliminating the edge effect of functions; establishing fork and forkout functions; conducting simulated implementation process, in the event offunction call, converting the function call to use functions and the parameters thereof as parameters, and introducing pseudo-call function; carrying out call relations of stain acquired functions tofunction call through adopting the infection characterization of VOLD; producing a series of function implementation sequences when reaching the terminal of the procedure; conducting distributed computation for one time by the implementation sequences and the parameters; and buffering the result and conducting second implementation to the code, in the process, in the event of function call, directly returning to the buffered data. The invention realizes the distribution and scheduling implementation computation of functions through establishing a model which can automatically dividing induction problems based on the general purpose language, and is suitable for applying in a large-scale distributed system.

A workflow for an operational process may be defined using a functional programming language. A computer system may parse the workflow to generate an abstract syntax tree, which may include states of the workflow and transitions from one workflow state to another. The computer system may generate code paths from the abstract syntax tree representing sequences of execution. Reflection on the workflow may be performed using the abstract syntax tree and code paths to allow intelligent decision-making.

The invention discloses an EDA development platform based on a Python language and a use method thereof. The development platform comprises a Python-based hardware description class library, a P2F interpreter for interpreting Python scripts, an FIRRTL language middle representation layer, an F2V interpreter for interpreting the FIRRTL language and a Veriator simulation tool for simulation testing.According to the invention, by adding an interpreter of Python language and FIRRTL language, and fully utilizing the characteristics that the Python language faces the object, supports the functionalprogramming, the polymorphism, the operator reloading, the multi-inheritance and the like, a user of the development platform can directly use the Python language to realize hardware description andtesting of the FPGA / ASIC chip, and the EDA development efficiency is greatly improved.