The following pages link to S. A. Nigiyan (Q174224):
Displaying 18 items.
- Partial decidability of the nonequivalence of free schemata (Q1136493) (← links)
- The nonequivalence problem for schemata with memory (Q1142579) (← links)
- Reducibility to free schemes (Q1157149) (← links)
- Horn programming with built-in predicates (Q1276515) (← links)
- Modification of the Robinson's resolution method for built-in predicates (Q1382912) (← links)
- Semantics of untyped functional programs (Q1403215) (← links)
- The resolution method for first-order predicate logic with interpreted predicates (Q1593948) (← links)
- On interpretation of functional programming languages (Q1817092) (← links)
- Functional languages (Q1817109) (← links)
- On equation systems in monotonic models of typed \(\lambda\)-calculus (Q2765372) (← links)
- On \(\lambda\)-definability of arithmetical functions with indeterminate values of arguments (Q2827607) (← links)
- (Q2951118) (← links)
- (Q3680243) (← links)
- (Q4556181) (← links)
- (Q4602236) (← links)
- (Q5219128) (← links)
- (Q5283606) (← links)
- Transformations of logic programs (Q5930885) (← links)
