Abstract: In programming environments, an object can be extended by adding a new property (subroutine) to the collection of the object properties. The properties of the object can be accessed using property access syntax. Extension property call is an innovation which allows the use of an object together with property access expression to access the properties (subroutines) that are not contained in the object itself, but which are contained in another object and are visible in the scope where the property access expression is used. The extension properties do not have special extension property definition syntax. Any regular property (subroutine) can be used as the extension property of the object if the property is visible in the scope where the property access expression is used. Extension property calls makes programming language code concise, improving code readability.

Abstract: Implicit parameters and implicit arguments are useful in many programming paradigms including functional and logic programming. Implicit parameter declaration order is inferred from the subroutine parameter usage order in the subroutine body. It means that implicit parameters have limited possibilities to be declared in the same order as programmers want. The parameter ignorance operator # allows changing implicit parameter order, but usage of this operator leads to subroutine declaration syntax similar to the syntax of declaring subroutine parameters explicitly, partially losing syntax benefits gained of implicit parameters. In order to preserve all the benefits of implicit parameter usage and allow programmers to change implicit parameter declaration order and scope in concise way, the Grace˜ operator, which is presented in this document, was invented.

Abstract: An embodiment of the present invention consists of methods for parameter declaration in implicit way and of methods for argument usage in implicit way. An embodiment of the present invention is useful in programming languages which support at least one concept that can be interpreted as a method. This invention: raises code readability; reduces redundancy of parameter name and parameter type information making specific parts of the programming language code more compact; allows reduction of global variables making code more parallelizable and suitable for parallel computing systems.

Abstract: The present invention is abstract, structured data store querying technology (system) which is capable of running deduction process in environment disconnected from data store. Logic programming engines does not know which facts it will need to correctly process questions (queries) and they require loading in memory and processing all data store content. Problem is solved introducing an abstraction: meta-set, which is able to describe one or more facts (becoming meta-facts). This way it is possible to separate data store from logic programming engine turning it into meta-set calculus engine which combines meta-facts and rules to build resulting list of meta-sets which will be used to auto-generate queries to data store. Proposed solution allows running deduction process in distributed environments where deduction can be performed on the client tier, and queries for real objects will be sent to centralized data store servers.