InvX

InvX: An automatic function inverter. We have implemented InvX, a system that will mechanically generate inverses for a substantial class of functions. By applying an extended set of function-level axioms at compile-time, expressions for the inverses are transformed so that no unification is required at run-time in many cases. This makes the cost of their execution comparable with that of reduction-based semantics. We have also described the incorporation of InvX in the FLAGSHIP programming environment. InvX has been used successfully on a wide range of examples.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 10 articles )

Showing results 1 to 10 of 10.
Sorted by year (citations)

  1. Nishida, Naoki; Vidal, Germán: Computing more specific versions of conditional rewriting systems (2013)
  2. Nagashima, Masanori; Sakai, Masahiko; Sakabe, Toshiki: Determinization of conditional term rewriting systems (2012)
  3. Nishida, Naoki; Vidal, German: Program inversion for tail recursive functions (2011)
  4. Almendros-Jiménez, Jesús M.; Vidal, Germán: Automatic partial inversion of inductively sequential functions (2007)
  5. Nishida, Naoki; Sakai, Masahiko; Sakabe, Toshiki: Partial inversion of constructor term rewriting systems (2005)
  6. Glück, Robert; Kawabe, Masahiko: Derivation of deterministic inverse programs based on LR parsing (2004)
  7. Glück, Robert; Kawabe, Masahiko: A program inverter for a functional language with equality and constructors. (2003)
  8. Abramov, Sergei; Glück, Robert: Principles of inverse computation and the universal resolving algorithm (2002)
  9. Abramov, Sergei; Glück, Robert: The universal resolving algorithm: Inverse computation in a functional language (2000)
  10. Dershowitz, Nachum (ed.): Rewriting techniques and applications. 3rd international conference, RTA- 89, Chapel Hill, NC, USA, April 3-5, 1989. Proceedings (1989)